From ca52393ba37b33ca549e6a17b3485f1aa396d512 Mon Sep 17 00:00:00 2001
From: Egor Kostan Test a function that processes sequence of jobs "
+ "and returns a positive integer representing the cc it"
+ "takes to complete the job at index. Test a function that take as parameter a list ls and "
+ "return a list of the sums of its parts as defined below:Test Description:
'
"")
# pylint: enable=R0801
- with allure.step("Pass a large list with no non consecutive numbers"):
+ with (allure.step("Pass a large list with no non consecutive numbers")):
lst: list = [36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57,
58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68,
@@ -84,30 +84,30 @@ def test_first_non_consecutive_large_list(self):
91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101,
102, 103, 104, 105, 106, 107, 108, 109, 110,
111, 112, 113, 114, 115, 116, 117, 118, 119]
- expected = None
+ expected: None = None
print_log(list=lst, expected=expected)
self.assertEqual(first_non_consecutive(lst), expected)
with allure.step("Pass a large list with no non consecutive numbers"):
- lst: list = [98, 99, 100, 101, 102, 103, 104, 105, 106, 107,
- 108, 109, 110, 111, 112, 113, 114, 115, 116, 117,
- 118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
- 128, 129, 130, 131, 132, 133, 134, 135, 136, 137,
- 138, 139, 140, 141, 142, 143, 144, 145, 146, 147,
- 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158]
+ lst = [98, 99, 100, 101, 102, 103, 104, 105, 106, 107,
+ 108, 109, 110, 111, 112, 113, 114, 115, 116, 117,
+ 118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
+ 128, 129, 130, 131, 132, 133, 134, 135, 136, 137,
+ 138, 139, 140, 141, 142, 143, 144, 145, 146, 147,
+ 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158]
expected = None
print_log(list=lst, expected=expected)
self.assertEqual(first_non_consecutive(lst), expected)
with allure.step("Pass a large list with non consecutive number"):
- lst: list = [61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73,
- 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86,
- 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
- 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111,
- 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122,
- 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133,
- 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144,
- 145, 146, 147, 148, 149]
+ lst = [61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73,
+ 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86,
+ 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+ 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111,
+ 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122,
+ 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133,
+ 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144,
+ 145, 146, 147, 148, 149]
expected: int = 101
print_log(list=lst, expected=expected)
self.assertEqual(first_non_consecutive(lst), expected)
@@ -136,35 +136,35 @@ def test_first_non_consecutive_positive(self):
self.assertEqual(first_non_consecutive(lst), expected)
with allure.step("Pass a list with positive non consecutive number"):
- lst: list = [4, 6, 7, 8, 9, 11]
- expected: int = 6
+ lst = [4, 6, 7, 8, 9, 11]
+ expected = 6
print_log(list=lst, expected=expected)
self.assertEqual(first_non_consecutive(lst), expected)
with allure.step("Pass a list with positive non consecutive number"):
- lst: list = [4, 5, 6, 7, 8, 9, 11]
- expected: int = 11
+ lst = [4, 5, 6, 7, 8, 9, 11]
+ expected = 11
print_log(list=lst, expected=expected)
self.assertEqual(first_non_consecutive(lst), expected)
with allure.step("Pass a list with positive non consecutive number"):
- lst: list = [-3, -2, 0, 1]
- expected: int = 0
+ lst = [-3, -2, 0, 1]
+ expected = 0
print_log(list=lst, expected=expected)
self.assertEqual(first_non_consecutive(lst), expected)
with allure.step("Pass a list with positive non consecutive number"):
- lst: list = [6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
- 17, 18, 19, 20, 21, 22, 23, 25, 26, 27]
- expected: int = 25
+ lst = [6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
+ 17, 18, 19, 20, 21, 22, 23, 25, 26, 27]
+ expected = 25
print_log(list=lst, expected=expected)
self.assertEqual(first_non_consecutive(lst), expected)
with allure.step("Pass a list with positive non consecutive number"):
- lst: list = [15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
- 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 39,
- 40, 41, 42, 43, 44, 45]
- expected: int = 39
+ lst = [15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
+ 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 39,
+ 40, 41, 42, 43, 44, 45]
+ expected = 39
print_log(list=lst, expected=expected)
self.assertEqual(first_non_consecutive(lst), expected)
From 5624d4d72e1c2bd818561dc5700527a9ea020802 Mon Sep 17 00:00:00 2001
From: Egor Kostan Test Description:
'
"")
# pylint: enable=R0801
- with (allure.step("Pass a large list with no non consecutive numbers")):
+ with allure.step("Pass a large list with no non consecutive numbers"):
lst: list = [36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57,
58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68,
From 0c2a33cac21e062a5c55099da620409ed7b92710 Mon Sep 17 00:00:00 2001
From: Egor Kostan ',
- 'end': ' '}
-}
+ 'end': ''}}
def to_table(data: list, header: bool = False, index: bool = False) -> str:
@@ -54,7 +53,7 @@ def to_table(data: list, header: bool = False, index: bool = False) -> str:
rows_and_columns += ''.join(f'{TABLE['header']['start']}'
f'{col}'
- f'{ TABLE['header']['end']}'
+ f'{TABLE['header']['end']}'
for b, col in enumerate(row))
rows_and_columns = (f'{rows_and_columns}'
From 6aadecb0f01d4a7d9ec9c5557446e59918678ec0 Mon Sep 17 00:00:00 2001
From: Egor Kostan Codewars badge:
'
+ ''
+ 'Test Description:
'
+ "Codewars badge:
'
@@ -71,7 +71,7 @@ def test_sjf(self):
for n, expected in test_data:
jobs, index = n
- actual_result = SJF(jobs, index)
+ actual_result = shortest_job_first(jobs, index)
# pylint: disable-msg=R0801
with allure.step(f"Enter a n ({n}) and verify the "
f"expected output ({expected}) vs "
From 1b808a4c18b80ec9a043c439136fd9f832972203 Mon Sep 17 00:00:00 2001
From: Egor Kostan Codewars badge:
'
+ ''
+ 'Test Description:
'
+ "
"
+ "ls = [1, 2, 3, 4, 5, 6]
"
+ "parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]"
+ "
The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"114c74c53ed8174f","name":"stdout","source":"114c74c53ed8174f.txt","type":"text/plain","size":243}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"b54ad09f549aa423.json","parameterValues":[]} \ No newline at end of file +{"uid":"11b4e7794c00f220","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c931c8cfab53b972","name":"stdout","source":"c931c8cfab53b972.txt","type":"text/plain","size":243}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"11b4e7794c00f220.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e650d3e05f6d005c.json b/allure-report/data/test-cases/11b652a05502070f.json similarity index 68% rename from allure-report/data/test-cases/e650d3e05f6d005c.json rename to allure-report/data/test-cases/11b652a05502070f.json index 0bb950bc84c..e6d484e06b1 100644 --- a/allure-report/data/test-cases/e650d3e05f6d005c.json +++ b/allure-report/data/test-cases/11b652a05502070f.json @@ -1 +1 @@ -{"uid":"e650d3e05f6d005c","name":"Testing pig_it function","fullName":"kyu_5.simple_pig_latin.test_pig_it.PigItTestCase#test_pig_it","historyId":"c5f1cfe64ff8d3a4f16a4166c571797e","time":{"start":1724735127875,"stop":1724735127875,"duration":0},"description":"\n Testing pig_it function\n\n The function should mpve the first letter of each\n word to the end of it, then add \"ay\" to the end\n of the word. Leave punctuation marks untouched.\n :return:\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Permutations"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e4e2296a825eac3f","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"6fbcaa806475fb37.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"1319e1ae94efdc02","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Permutations"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a08dd22616aac704","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"6fbcaa806475fb37","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"1319e1ae94efdc02.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/aad768e2b1065e77.json b/allure-report/data/test-cases/133341d40af1e905.json
similarity index 77%
rename from allure-report/data/test-cases/aad768e2b1065e77.json
rename to allure-report/data/test-cases/133341d40af1e905.json
index f5e8ccac8c0..626e3693e30 100644
--- a/allure-report/data/test-cases/aad768e2b1065e77.json
+++ b/allure-report/data/test-cases/133341d40af1e905.json
@@ -1 +1 @@
-{"uid":"aad768e2b1065e77","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"20ec3b37f02414c6","name":"stdout","source":"20ec3b37f02414c6.txt","type":"text/plain","size":117}],"parameters":[],"stepsCount":2,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"aad768e2b1065e77.json","parameterValues":[]} \ No newline at end of file +{"uid":"133341d40af1e905","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b4f27bd29772e298","name":"stdout","source":"b4f27bd29772e298.txt","type":"text/plain","size":117}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"133341d40af1e905.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7f23a2b3d247ad31.json b/allure-report/data/test-cases/139c28ca38674b14.json similarity index 71% rename from allure-report/data/test-cases/7f23a2b3d247ad31.json rename to allure-report/data/test-cases/139c28ca38674b14.json index fcbbffa436f..8ada559e423 100644 --- a/allure-report/data/test-cases/7f23a2b3d247ad31.json +++ b/allure-report/data/test-cases/139c28ca38674b14.json @@ -1 +1 @@ -{"uid":"7f23a2b3d247ad31","name":"Testing hoop_count function (positive test case)","fullName":"kyu_8.keep_up_the_hoop.test_hoop_count.HoopCountTestCase#test_hoop_count_positive","historyId":"4110170ab332498939ad9f2d0f38cf97","time":{"start":1724735129570,"stop":1724735129570,"duration":0},"description":"\n Testing hoop_count function\n\n Alex just got a new hula hoop, he loves it but feels\n discouraged because his little brother is better than him\n\n Write a program where Alex can input (n) how many times\n the hoop goes round and it will return him an encouraging message\n\n - If Alex gets 10 or more hoops, return the string \"Great, now move on to tricks\".\n - If he doesn't get 10 hoops, return the string \"Keep at it until you get it\".\n\n :return:\n ","descriptionHtml":"The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"65073b7edfec4e6b.json","parameterValues":[]} \ No newline at end of file +{"uid":"1467bda4d9665eda","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"1467bda4d9665eda.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a42793a5da57f5c7.json b/allure-report/data/test-cases/148a22b7e430194f.json similarity index 56% rename from allure-report/data/test-cases/a42793a5da57f5c7.json rename to allure-report/data/test-cases/148a22b7e430194f.json index 96f5961315d..143681d5c32 100644 --- a/allure-report/data/test-cases/a42793a5da57f5c7.json +++ b/allure-report/data/test-cases/148a22b7e430194f.json @@ -1 +1 @@ -{"uid":"a42793a5da57f5c7","name":"Testing increment_string function","fullName":"kyu_5.string_incrementer.test_increment_string.StringIncrementerTestCase#test_increment_string","historyId":"5d0f5e220c2579103119e57300b46215","time":{"start":1724735127891,"stop":1724735127891,"duration":0},"description":"\n Testing a function named increment_string\n\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a22ae5e3f6546093","name":"stdout","source":"a22ae5e3f6546093.txt","type":"text/plain","size":1009}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Snail"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ad991ec2a2bdb70","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"16026a681cee6bae.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/66511dda8143933e.json b/allure-report/data/test-cases/1719ddf6913445c8.json similarity index 68% rename from allure-report/data/test-cases/66511dda8143933e.json rename to allure-report/data/test-cases/1719ddf6913445c8.json index 49c5254cd05..e81e1adbeb3 100644 --- a/allure-report/data/test-cases/66511dda8143933e.json +++ b/allure-report/data/test-cases/1719ddf6913445c8.json @@ -1 +1 @@ -{"uid":"66511dda8143933e","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"70a62533038d97f8","name":"stdout","source":"70a62533038d97f8.txt","type":"text/plain","size":1127}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9835bf28bd7241b2","status":"passed","time":{"start":1724733473960,"stop":1724733473960,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"66511dda8143933e.json","parameterValues":[]} \ No newline at end of file +{"uid":"1719ddf6913445c8","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a8cdc7c5d92ea524","name":"stdout","source":"a8cdc7c5d92ea524.txt","type":"text/plain","size":1127}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"abba91be3722688b","status":"passed","time":{"start":1724733473960,"stop":1724733473960,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"66511dda8143933e","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"1719ddf6913445c8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d611744698a52752.json b/allure-report/data/test-cases/1728ec761d912068.json similarity index 73% rename from allure-report/data/test-cases/d611744698a52752.json rename to allure-report/data/test-cases/1728ec761d912068.json index e9dba6c2817..9497f693287 100644 --- a/allure-report/data/test-cases/d611744698a52752.json +++ b/allure-report/data/test-cases/1728ec761d912068.json @@ -1 +1 @@ -{"uid":"d611744698a52752","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c3b009b2f078b1df","name":"stdout","source":"c3b009b2f078b1df.txt","type":"text/plain","size":639}],"parameters":[],"stepsCount":9,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Aggregations"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"d611744698a52752.json","parameterValues":[]} \ No newline at end of file +{"uid":"1728ec761d912068","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8e2411421a238415","name":"stdout","source":"8e2411421a238415.txt","type":"text/plain","size":639}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Aggregations"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"1728ec761d912068.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f98184cdb1c288eb.json b/allure-report/data/test-cases/17d8ff61005bb0bc.json similarity index 68% rename from allure-report/data/test-cases/f98184cdb1c288eb.json rename to allure-report/data/test-cases/17d8ff61005bb0bc.json index b75f9ba6bf9..538524e9b35 100644 --- a/allure-report/data/test-cases/f98184cdb1c288eb.json +++ b/allure-report/data/test-cases/17d8ff61005bb0bc.json @@ -1 +1 @@ -{"uid":"f98184cdb1c288eb","name":"Zero","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_zero","historyId":"e47953912bc73286c8a01ce448ee3c54","time":{"start":1724733474538,"stop":1724733474538,"duration":0},"description":"\n 0 is a square number\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"b3fc81b6d668011d","name":"stdout","source":"b3fc81b6d668011d.txt","type":"text/plain","size":22}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"bf1274fce77ea3c3","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"2030ea00b6998f67.json","parameterValues":[]} \ No newline at end of file +{"uid":"1b3bd0a5ea1aa072","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"35b0040677726bbd","name":"stdout","source":"35b0040677726bbd.txt","type":"text/plain","size":22}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"a381266642fdbdd2","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"2030ea00b6998f67","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"1b3bd0a5ea1aa072.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a5efb61e311267c0.json b/allure-report/data/test-cases/1b8dc3acaf7dd027.json similarity index 72% rename from allure-report/data/test-cases/a5efb61e311267c0.json rename to allure-report/data/test-cases/1b8dc3acaf7dd027.json index d83b2563d80..7518cc12392 100644 --- a/allure-report/data/test-cases/a5efb61e311267c0.json +++ b/allure-report/data/test-cases/1b8dc3acaf7dd027.json @@ -1 +1 @@ -{"uid":"a5efb61e311267c0","name":"Testing 'save' function: negative","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_negative","historyId":"eb89ee17d2b7a29796b27ce5ba503de6","time":{"start":1724733474241,"stop":1724733474241,"duration":0},"description":"\n Testing 'save' function: negative\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"38a17c1a51c46902","name":"stdout","source":"38a17c1a51c46902.txt","type":"text/plain","size":225}],"parameters":[],"stepsCount":2,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Strip Comments"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"3f5cda838e1e2c35.json","parameterValues":[]} \ No newline at end of file +{"uid":"1bbe34ba42279f71","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1724733472421,"stop":1724733472437,"duration":16},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1fc52e2c49c9d723","name":"stdout","source":"1fc52e2c49c9d723.txt","type":"text/plain","size":225}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Strip Comments"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"1bbe34ba42279f71.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dea681370cee7fa1.json b/allure-report/data/test-cases/1c0de6c68e45d781.json similarity index 72% rename from allure-report/data/test-cases/dea681370cee7fa1.json rename to allure-report/data/test-cases/1c0de6c68e45d781.json index aa0e315e37a..89bfe0d1ed2 100644 --- a/allure-report/data/test-cases/dea681370cee7fa1.json +++ b/allure-report/data/test-cases/1c0de6c68e45d781.json @@ -1 +1 @@ -{"uid":"dea681370cee7fa1","name":"Testing is_palindrome function","fullName":"kyu_8.is_it_a_palindrome.test_is_palindrome.IsPalindromeTestCase#test_is_palindrome","historyId":"4967a6ca0665c8eeeec85898f8bda8f5","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"description":"\n Testing is_palindrome function\n with various test inputs\n\n The function should check if a\n given string (case insensitive)\n is a palindrome.\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"3e7b87e8229dd1a3","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"e5ac2209dd79eabb.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"1dee8c06fd165199","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9a93b35004a87c6a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"e5ac2209dd79eabb","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"1dee8c06fd165199.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/fe9e7cd98fc040fc.json b/allure-report/data/test-cases/1dfdd5c5551a6420.json
similarity index 63%
rename from allure-report/data/test-cases/fe9e7cd98fc040fc.json
rename to allure-report/data/test-cases/1dfdd5c5551a6420.json
index 41659fd58e9..8c836bbb2bc 100644
--- a/allure-report/data/test-cases/fe9e7cd98fc040fc.json
+++ b/allure-report/data/test-cases/1dfdd5c5551a6420.json
@@ -1 +1 @@
-{"uid":"fe9e7cd98fc040fc","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string aba and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string moOse and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a048397ca4ccbb02","name":"stdout","source":"a048397ca4ccbb02.txt","type":"text/plain","size":401}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Isograms"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"String"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"fe9e7cd98fc040fc.json","parameterValues":[]} \ No newline at end of file +{"uid":"1dfdd5c5551a6420","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string aba and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string moOse and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"dc00b83d62a7bfbf","name":"stdout","source":"dc00b83d62a7bfbf.txt","type":"text/plain","size":401}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Isograms"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"String"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"1dfdd5c5551a6420.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fa56d75fd8c33c3c.json b/allure-report/data/test-cases/1e3570598c901af4.json similarity index 64% rename from allure-report/data/test-cases/fa56d75fd8c33c3c.json rename to allure-report/data/test-cases/1e3570598c901af4.json index edb6ef2cd7d..b1b686f948c 100644 --- a/allure-report/data/test-cases/fa56d75fd8c33c3c.json +++ b/allure-report/data/test-cases/1e3570598c901af4.json @@ -1 +1 @@ -{"uid":"fa56d75fd8c33c3c","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"79af870721a1c097","name":"stdout","source":"79af870721a1c097.txt","type":"text/plain","size":1865}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Lists"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"fa56d75fd8c33c3c.json","parameterValues":[]} \ No newline at end of file +{"uid":"1e3570598c901af4","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4158b1e0c4f5a122","name":"stdout","source":"4158b1e0c4f5a122.txt","type":"text/plain","size":1865}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Lists"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"1e3570598c901af4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1e52950a202e2f6f.json b/allure-report/data/test-cases/1e52950a202e2f6f.json new file mode 100644 index 00000000000..08a22eb5f4b --- /dev/null +++ b/allure-report/data/test-cases/1e52950a202e2f6f.json @@ -0,0 +1 @@ +{"uid":"1e52950a202e2f6f","name":"Testing the 'unique_in_order' function","fullName":"kyu_6.unique_in_order.test_unique_in_order.UniqueInOrderTestCase#test_unique_in_order","historyId":"9cff2d5d4d73fbc92b1c7c29d738384f","time":{"start":1724733474116,"stop":1724733474116,"duration":0},"description":"\n Testing the 'unique_in_order' function\n with various test data\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"Lists"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"eb2c31b2b7e0b335.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"20308d2341c6b899","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"Lists"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"20308d2341c6b899.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/e0604dcf0c194a67.json b/allure-report/data/test-cases/204251456ada0752.json
similarity index 72%
rename from allure-report/data/test-cases/e0604dcf0c194a67.json
rename to allure-report/data/test-cases/204251456ada0752.json
index 6cfafe4c208..0fa4d6760b9 100644
--- a/allure-report/data/test-cases/e0604dcf0c194a67.json
+++ b/allure-report/data/test-cases/204251456ada0752.json
@@ -1 +1 @@
-{"uid":"e0604dcf0c194a67","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"524678a9109bb789","name":"stdout","source":"524678a9109bb789.txt","type":"text/plain","size":434}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"e0604dcf0c194a67.json","parameterValues":[]} \ No newline at end of file +{"uid":"204251456ada0752","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2dcda4c0465e81d2","name":"stdout","source":"2dcda4c0465e81d2.txt","type":"text/plain","size":434}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"204251456ada0752.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/78e4d411e3c9974d.json b/allure-report/data/test-cases/2077f18aded36c8a.json similarity index 72% rename from allure-report/data/test-cases/78e4d411e3c9974d.json rename to allure-report/data/test-cases/2077f18aded36c8a.json index 4237fafe32c..3623bd44c77 100644 --- a/allure-report/data/test-cases/78e4d411e3c9974d.json +++ b/allure-report/data/test-cases/2077f18aded36c8a.json @@ -1 +1 @@ -{"uid":"78e4d411e3c9974d","name":"Square numbers (positive)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_four","historyId":"861b34050c3ab0a994fa20a6090c5ab5","time":{"start":1724733474538,"stop":1724733474538,"duration":0},"description":"\n 4 is a square number\n :return:\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"9130d2ce9d2203c6.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"22fcf1edf8ebf197","name":"test_line_negative","fullName":"kyu_3.line_safari_is_that_a_line.test_line_negative.LineNegativeTestCase#test_line_negative","historyId":"e5c7abe0fcf3b79049d906f50808feb6","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Line Safari functionality\n Negative test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"22fcf1edf8ebf197.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/ffa8274e0de065ab.json b/allure-report/data/test-cases/2348115dae27ed81.json
similarity index 71%
rename from allure-report/data/test-cases/ffa8274e0de065ab.json
rename to allure-report/data/test-cases/2348115dae27ed81.json
index fb97251d5fd..62b34295e68 100644
--- a/allure-report/data/test-cases/ffa8274e0de065ab.json
+++ b/allure-report/data/test-cases/2348115dae27ed81.json
@@ -1 +1 @@
-{"uid":"ffa8274e0de065ab","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"628a7fe95e3c81cb","name":"stdout","source":"628a7fe95e3c81cb.txt","type":"text/plain","size":908}],"parameters":[],"stepsCount":14,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"FEATURES"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"PROGRAMMING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LANGUAGE","DECLARATIVE","REGULAR","EXPRESSIONS","FUNDAMENTALS","PROGRAMMING","FEATURES","ADVANCED"]},"source":"ffa8274e0de065ab.json","parameterValues":[]} \ No newline at end of file +{"uid":"2348115dae27ed81","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"cf2100e65e09b423","name":"stdout","source":"cf2100e65e09b423.txt","type":"text/plain","size":908}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":14,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"FEATURES"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"PROGRAMMING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LANGUAGE","DECLARATIVE","REGULAR","EXPRESSIONS","FUNDAMENTALS","PROGRAMMING","FEATURES","ADVANCED"]},"source":"2348115dae27ed81.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9c8287ca55a94ba5.json b/allure-report/data/test-cases/23b523b580f78123.json similarity index 56% rename from allure-report/data/test-cases/9c8287ca55a94ba5.json rename to allure-report/data/test-cases/23b523b580f78123.json index 9d88de626be..6883b226109 100644 --- a/allure-report/data/test-cases/9c8287ca55a94ba5.json +++ b/allure-report/data/test-cases/23b523b580f78123.json @@ -1 +1 @@ -{"uid":"9c8287ca55a94ba5","name":"Testing check_root function","fullName":"kyu_7.always_perfect.test_check_root.CheckRootTestCase#test_check_root","historyId":"9c2d30046a2fe35ee19c9d3833ea20a5","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"description":"\n Testing check_root function with various test inputs\n\n A function which takes numbers separated by commas\n in string format and returns the number which is a\n perfect square and the square root of that number.\n\n If string contains other characters than number or\n it has more or less than 4 numbers separated by comma\n function returns \"incorrect input\".\n\n If string contains 4 numbers but not consecutive it\n returns \"not consecutive\".\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"461c8c952ae09079","name":"stdout","source":"461c8c952ae09079.txt","type":"text/plain","size":1579}],"parameters":[],"stepsCount":7,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"23d2f8eb0089d9c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/afdaa298aab7eba8.json b/allure-report/data/test-cases/2460353038ce1955.json similarity index 61% rename from allure-report/data/test-cases/afdaa298aab7eba8.json rename to allure-report/data/test-cases/2460353038ce1955.json index b2e72df2e4e..fb5f844f441 100644 --- a/allure-report/data/test-cases/afdaa298aab7eba8.json +++ b/allure-report/data/test-cases/2460353038ce1955.json @@ -1 +1 @@ -{"uid":"afdaa298aab7eba8","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9a6a869c56ca7757","name":"stdout","source":"9a6a869c56ca7757.txt","type":"text/plain","size":882}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"77d55c76ce916d94","status":"passed","time":{"start":1724733472421,"stop":1724733472421,"duration":0}}],"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"afdaa298aab7eba8.json","parameterValues":[]} \ No newline at end of file +{"uid":"2460353038ce1955","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b7bfbf78e894e0ca","name":"stdout","source":"b7bfbf78e894e0ca.txt","type":"text/plain","size":882}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"55d1d73293e16236","status":"passed","time":{"start":1724733472421,"stop":1724733472421,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"afdaa298aab7eba8","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"2460353038ce1955.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c16d54e01aa089ec.json b/allure-report/data/test-cases/2512233f29820ca9.json similarity index 65% rename from allure-report/data/test-cases/c16d54e01aa089ec.json rename to allure-report/data/test-cases/2512233f29820ca9.json index 16c68578316..9e056a3a634 100644 --- a/allure-report/data/test-cases/c16d54e01aa089ec.json +++ b/allure-report/data/test-cases/2512233f29820ca9.json @@ -1 +1 @@ -{"uid":"c16d54e01aa089ec","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724733472796,"stop":1724733472921,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472843,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472843,"stop":1724733472890,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472890,"stop":1724733472921,"duration":31},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1a418dd5b9f09793","name":"stdout","source":"1a418dd5b9f09793.txt","type":"text/plain","size":932}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OPTIMIZATION"},{"name":"feature","value":"Optimization"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Integers: Recreation One"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"c16d54e01aa089ec.json","parameterValues":[]} \ No newline at end of file +{"uid":"2512233f29820ca9","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724733472796,"stop":1724733472921,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472843,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472843,"stop":1724733472890,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472890,"stop":1724733472921,"duration":31},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4cd1e84a01209f22","name":"stdout","source":"4cd1e84a01209f22.txt","type":"text/plain","size":932}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OPTIMIZATION"},{"name":"feature","value":"Optimization"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Integers: Recreation One"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"2512233f29820ca9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b93db50e25bdce85.json b/allure-report/data/test-cases/252f381a068f762f.json similarity index 71% rename from allure-report/data/test-cases/b93db50e25bdce85.json rename to allure-report/data/test-cases/252f381a068f762f.json index faf6d0347f9..2b63931f001 100644 --- a/allure-report/data/test-cases/b93db50e25bdce85.json +++ b/allure-report/data/test-cases/252f381a068f762f.json @@ -1 +1 @@ -{"uid":"b93db50e25bdce85","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bbdde990c6eec147","name":"stdout","source":"bbdde990c6eec147.txt","type":"text/plain","size":676}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LOOPS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"b93db50e25bdce85.json","parameterValues":[]} \ No newline at end of file +{"uid":"252f381a068f762f","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6062d7cf7b32bc2c","name":"stdout","source":"6062d7cf7b32bc2c.txt","type":"text/plain","size":676}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LOOPS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"252f381a068f762f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9e49aa125a2c6746.json b/allure-report/data/test-cases/25be1d40d6774add.json similarity index 66% rename from allure-report/data/test-cases/9e49aa125a2c6746.json rename to allure-report/data/test-cases/25be1d40d6774add.json index 7dfc602b3b7..6dc91fdcbcf 100644 --- a/allure-report/data/test-cases/9e49aa125a2c6746.json +++ b/allure-report/data/test-cases/25be1d40d6774add.json @@ -1 +1 @@ -{"uid":"9e49aa125a2c6746","name":"Testing remove_char function","fullName":"kyu_8.remove_first_and_last_character.test_remove_char.RemoveCharTestCase#test_remove_char","historyId":"094915dd36d829c22ed2375a32962ac5","time":{"start":1724733474866,"stop":1724733474866,"duration":0},"description":"\n Test that 'remove_char' function\n removes the first and\n last characters of a string.\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d5eb9c17e95fe424","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"34febd97f08d8df7","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"26cf86ca9eda4b5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b04dd834a1d39093.json b/allure-report/data/test-cases/270b5395a9143b9c.json similarity index 71% rename from allure-report/data/test-cases/b04dd834a1d39093.json rename to allure-report/data/test-cases/270b5395a9143b9c.json index 545a5003bc6..145be627c57 100644 --- a/allure-report/data/test-cases/b04dd834a1d39093.json +++ b/allure-report/data/test-cases/270b5395a9143b9c.json @@ -1 +1 @@ -{"uid":"b04dd834a1d39093","name":"String with alphabet chars only","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_alpha_only","historyId":"f1e3ad74179a106b1d5dc35a6ffe21fa","time":{"start":1724733473913,"stop":1724733473913,"duration":0},"description":"\n Test string with alphabet chars only\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e7476696af18d9ef","name":"stdout","source":"e7476696af18d9ef.txt","type":"text/plain","size":222}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"tags":["Algorithms","Logic","Strings"]},"source":"f80f9bf6821c7c25.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"280a7287fd39d5a9","name":"test_basic","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_basic","historyId":"81b718c3bba361637ce9ed2266cd30d2","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5b1486b52334c41e","name":"stdout","source":"5b1486b52334c41e.txt","type":"text/plain","size":222}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"f80f9bf6821c7c25","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"280a7287fd39d5a9.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/29266ed99d46b2a.json b/allure-report/data/test-cases/29266ed99d46b2a.json
deleted file mode 100644
index d3f0ef0d54f..00000000000
--- a/allure-report/data/test-cases/29266ed99d46b2a.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"29266ed99d46b2a","name":"Testing 'has_subpattern' (part 3) function","fullName":"kyu_6.string_subpattern_recognition_3.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"89f53112353ba49dc8f3a4029d39ba34","time":{"start":1724735128946,"stop":1724735128946,"duration":0},"description":"\n Verify that 'has_subpattern' function\n\n Return a subpattern with sorted characters,\n otherwise return the base string with sorted\n characters (you might consider this case as\n an edge case, with the subpattern being repeated\n only once and thus equalling the original input string).\n :return:\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d015bd8e99b083ac","name":"stdout","source":"d015bd8e99b083ac.txt","type":"text/plain","size":931}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sum of Pairs"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"MEMOIZATION"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"feature","value":"Memoization"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f3421cdd7cb94a40","status":"passed","time":{"start":1724733472999,"stop":1724733472999,"duration":0}}],"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"be5a8376fdcba717.json","parameterValues":[]} \ No newline at end of file +{"uid":"2965d2d3db0ea08e","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6f54ca69ed4a797e","name":"stdout","source":"6f54ca69ed4a797e.txt","type":"text/plain","size":931}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sum of Pairs"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"MEMOIZATION"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"feature","value":"Memoization"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"895ce9b19a080b91","status":"passed","time":{"start":1724733472999,"stop":1724733472999,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"be5a8376fdcba717","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}}]},"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"2965d2d3db0ea08e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fb3ce43e36479ba0.json b/allure-report/data/test-cases/2aa3a63b6fff605a.json similarity index 55% rename from allure-report/data/test-cases/fb3ce43e36479ba0.json rename to allure-report/data/test-cases/2aa3a63b6fff605a.json index d7d2d9c5a89..a6af894e487 100644 --- a/allure-report/data/test-cases/fb3ce43e36479ba0.json +++ b/allure-report/data/test-cases/2aa3a63b6fff605a.json @@ -1 +1 @@ -{"uid":"fb3ce43e36479ba0","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"25c4d55846b6e292","name":"stdout","source":"25c4d55846b6e292.txt","type":"text/plain","size":554}],"parameters":[],"stepsCount":10,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7fad3735c185529a","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"fb3ce43e36479ba0.json","parameterValues":[]} \ No newline at end of file +{"uid":"2aa3a63b6fff605a","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"47bd852e88dda4bd","name":"stdout","source":"47bd852e88dda4bd.txt","type":"text/plain","size":554}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f8cc7e1ba1a4852f","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"fb3ce43e36479ba0","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"2aa3a63b6fff605a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b843b5b7994550ed.json b/allure-report/data/test-cases/2acb560e089cb7c8.json similarity index 63% rename from allure-report/data/test-cases/b843b5b7994550ed.json rename to allure-report/data/test-cases/2acb560e089cb7c8.json index dac93562f2b..6749e4af168 100644 --- a/allure-report/data/test-cases/b843b5b7994550ed.json +++ b/allure-report/data/test-cases/2acb560e089cb7c8.json @@ -1 +1 @@ -{"uid":"b843b5b7994550ed","name":"Test with one char only","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_one_char","historyId":"e3d629a995491cb3a3079998a04583ff","time":{"start":1724735129649,"stop":1724735129649,"duration":0},"description":"\n Test with one char only\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6cceaf28d236f584","name":"stdout","source":"6cceaf28d236f584.txt","type":"text/plain","size":1380}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ASCII"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Character Encodings"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BINARY"},{"name":"tag","value":"FORMATS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9cc84b4c3c851a20","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"5c281d5272513bfd","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["CHARACTER ENCODINGS","STRINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"2b38fe6b8a5a46.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2b3e2264864275ed.json b/allure-report/data/test-cases/2b3e2264864275ed.json deleted file mode 100644 index 596e514c09c..00000000000 --- a/allure-report/data/test-cases/2b3e2264864275ed.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"2b3e2264864275ed","name":"Testing 'sum_triangular_numbers' with zero","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_zero","historyId":"fc1061f17dd61adf726ad7c2bb23539c","time":{"start":1724733474491,"stop":1724733474491,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with zero as an input\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Insert items to the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6344061f744d93d","name":"stdout","source":"6344061f744d93d.txt","type":"text/plain","size":261}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"474af6c568bdf675","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"93b3042e12ae0dc2","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"2c78d4954ac14f9e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c2e82f2f4bdc38ce.json b/allure-report/data/test-cases/2cfa19c331ab824b.json similarity index 68% rename from allure-report/data/test-cases/c2e82f2f4bdc38ce.json rename to allure-report/data/test-cases/2cfa19c331ab824b.json index 2bc77f94a00..298b3e9df8a 100644 --- a/allure-report/data/test-cases/c2e82f2f4bdc38ce.json +++ b/allure-report/data/test-cases/2cfa19c331ab824b.json @@ -1 +1 @@ -{"uid":"c2e82f2f4bdc38ce","name":"Testing 'thirt' function","fullName":"kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase#test_thirt","historyId":"b223f14337b9b49b6e64d94d9479e857","time":{"start":1724733473046,"stop":1724733473061,"duration":15},"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ee54cc9a323ef73f","name":"stdout","source":"ee54cc9a323ef73f.txt","type":"text/plain","size":318}],"parameters":[],"stepsCount":7,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"c2e82f2f4bdc38ce.json","parameterValues":[]} \ No newline at end of file +{"uid":"2cfa19c331ab824b","name":"Testing 'thirt' function","fullName":"kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase#test_thirt","historyId":"b223f14337b9b49b6e64d94d9479e857","time":{"start":1724733473046,"stop":1724733473061,"duration":15},"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f25bb18adfb0c750","name":"stdout","source":"f25bb18adfb0c750.txt","type":"text/plain","size":318}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"2cfa19c331ab824b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2d25cb87282ab722.json b/allure-report/data/test-cases/2d25cb87282ab722.json new file mode 100644 index 00000000000..78b7ee8c639 --- /dev/null +++ b/allure-report/data/test-cases/2d25cb87282ab722.json @@ -0,0 +1 @@ +{"uid":"2d25cb87282ab722","name":"Testing 'sum_triangular_numbers' with big number as an input","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_big_number","historyId":"e2716f691be2a9d6b5fd30d66b1f784d","time":{"start":1724733474476,"stop":1724733474476,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with big number as an input\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"77d84c2ff475cafc","name":"stdout","source":"77d84c2ff475cafc.txt","type":"text/plain","size":243}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724735128930,"stop":1724735128930,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b54ad09f549aa423","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"1ef3e1da7f90eb82.json","parameterValues":[]} \ No newline at end of file +{"uid":"31cd5c9e8017f83c","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1724735128914,"stop":1724735128930,"duration":16},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"92abbc4fad82e6db","name":"stdout","source":"92abbc4fad82e6db.txt","type":"text/plain","size":243}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724735128930,"stop":1724735128930,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"11b4e7794c00f220","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"1ef3e1da7f90eb82","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}}]},"tags":["FUNDAMENTALS","ARRAYS"]},"source":"31cd5c9e8017f83c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cdb5c235f1a637f6.json b/allure-report/data/test-cases/31f6e05cb2bf8e17.json similarity index 76% rename from allure-report/data/test-cases/cdb5c235f1a637f6.json rename to allure-report/data/test-cases/31f6e05cb2bf8e17.json index 6c5617b10ea..15b597f1218 100644 --- a/allure-report/data/test-cases/cdb5c235f1a637f6.json +++ b/allure-report/data/test-cases/31f6e05cb2bf8e17.json @@ -1 +1 @@ -{"uid":"cdb5c235f1a637f6","name":"STesting enough function","fullName":"kyu_8.will_there_be_enough_space.test_enough.EnoughTestCase#test_enough","historyId":"a2768f68ae825ba2b78473ceb0eb184a","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"description":"\n Testing enough function\n with various test data\n\n If there is enough space, return 0,\n and if there isn't, return the number\n of passengers he can't take.\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d97724b3c30f749b","name":"stdout","source":"d97724b3c30f749b.txt","type":"text/plain","size":230}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"3e075566662ada8b","status":"passed","time":{"start":1724733474725,"stop":1724733474725,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS"]},"source":"c301f45b01d7d10f.json","parameterValues":[]} \ No newline at end of file +{"uid":"327fbdea3443aca5","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7dbffa484c49e1de","name":"stdout","source":"7dbffa484c49e1de.txt","type":"text/plain","size":230}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b0f9b8de2eb00fed","status":"passed","time":{"start":1724733474725,"stop":1724733474725,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"c301f45b01d7d10f","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"327fbdea3443aca5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/337891d8027fbc46.json b/allure-report/data/test-cases/337891d8027fbc46.json new file mode 100644 index 00000000000..cab89a7138e --- /dev/null +++ b/allure-report/data/test-cases/337891d8027fbc46.json @@ -0,0 +1 @@ +{"uid":"337891d8027fbc46","name":"String with no alphabet chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_no_alpha","historyId":"eb9123a4aa86a26d4fdbf67e2370745f","time":{"start":1724735128789,"stop":1724735128789,"duration":0},"description":"\n Test string with no alphabet chars\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"51e59668932e1548","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"34febd97f08d8df7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/928532982127bba0.json b/allure-report/data/test-cases/35cf25b9e515e00d.json similarity index 65% rename from allure-report/data/test-cases/928532982127bba0.json rename to allure-report/data/test-cases/35cf25b9e515e00d.json index 2c403b33c72..0ec20ef317a 100644 --- a/allure-report/data/test-cases/928532982127bba0.json +++ b/allure-report/data/test-cases/35cf25b9e515e00d.json @@ -1 +1 @@ -{"uid":"928532982127bba0","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"51125223dfac2107","name":"stdout","source":"51125223dfac2107.txt","type":"text/plain","size":434}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"e0604dcf0c194a67","status":"passed","time":{"start":1724733475038,"stop":1724733475038,"duration":0}}],"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"928532982127bba0.json","parameterValues":[]} \ No newline at end of file +{"uid":"35cf25b9e515e00d","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"839e0167efc9a3e5","name":"stdout","source":"839e0167efc9a3e5.txt","type":"text/plain","size":434}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"204251456ada0752","status":"passed","time":{"start":1724733475038,"stop":1724733475038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"928532982127bba0","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"35cf25b9e515e00d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2c4e292a782b80e3.json b/allure-report/data/test-cases/369d691aa58bf89d.json similarity index 66% rename from allure-report/data/test-cases/2c4e292a782b80e3.json rename to allure-report/data/test-cases/369d691aa58bf89d.json index d971983cd0f..3da71cf73a6 100644 --- a/allure-report/data/test-cases/2c4e292a782b80e3.json +++ b/allure-report/data/test-cases/369d691aa58bf89d.json @@ -1 +1 @@ -{"uid":"2c4e292a782b80e3","name":"Testing zeros function","fullName":"kyu_5.number_of_trailing_zeros_of_n.test_zeros.ZerosTestCase#test_zeros","historyId":"bf37412e0e610d07d951e5fde674ec97","time":{"start":1724735127860,"stop":1724735127860,"duration":0},"description":"\n Testing 'zeros' program that should calculate the number\n of trailing zeros in a factorial of a given number.\n :return: None\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert training","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert battle","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"47eb10d648ead31b","name":"stdout","source":"47eb10d648ead31b.txt","type":"text/plain","size":67}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":12,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"72010ab4f2692ae4","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"bc3230f80ad8864d","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"37b95a78feb35857.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cf2235e5886d8954.json b/allure-report/data/test-cases/38639b46d1e381a9.json similarity index 70% rename from allure-report/data/test-cases/cf2235e5886d8954.json rename to allure-report/data/test-cases/38639b46d1e381a9.json index b765eb39752..0fa38574851 100644 --- a/allure-report/data/test-cases/cf2235e5886d8954.json +++ b/allure-report/data/test-cases/38639b46d1e381a9.json @@ -1 +1 @@ -{"uid":"cf2235e5886d8954","name":"Testing compute_ranks","fullName":"kyu_5.sports_league_table_ranking.test_compute_ranks.ComputeRanksTestCase#test_something","historyId":"21739eee721a124a84e5414945df03e6","time":{"start":1724735127891,"stop":1724735127891,"duration":0},"description":"\n Test the function that organizes a sports league in a\n round-robin-system. Each team meets all other teams.\n In your league a win gives a team 2 points, a draw gives\n both teams 1 point. After some games you have to compute\n the order of the teams in your league. You use the following\n criteria to arrange the teams:\n\n - Points\n - Scoring differential (the difference between goals scored and those conceded)\n - Goals scored\n\n :return:\n ","descriptionHtml":"Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"78dec26e63ca72b","name":"stdout","source":"78dec26e63ca72b.txt","type":"text/plain","size":544}],"parameters":[],"stepsCount":7,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNCTIONS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Games"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"abf7d26758417bf9","status":"passed","time":{"start":1724733474023,"stop":1724733474023,"duration":0}}],"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","GAMES","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"396df158495e2556.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/df9e62f886d5e100.json b/allure-report/data/test-cases/398c0a461bbe2313.json similarity index 75% rename from allure-report/data/test-cases/df9e62f886d5e100.json rename to allure-report/data/test-cases/398c0a461bbe2313.json index 167ababd9cb..c41953b2747 100644 --- a/allure-report/data/test-cases/df9e62f886d5e100.json +++ b/allure-report/data/test-cases/398c0a461bbe2313.json @@ -1 +1 @@ -{"uid":"df9e62f886d5e100","name":"Testing digital_root function","fullName":"kyu_6.sum_of_digits_digital_root.test_digital_root.DigitalRootTestCase#test_digital_root","historyId":"3d4d9d606fbf24bad8abb0f0f85e6130","time":{"start":1724733474116,"stop":1724733474116,"duration":0},"description":"\n In this kata, you must create a digital root function.\n\n A digital root is the recursive sum of all the digits\n in a number. Given n, take the sum of the digits of n.\n If that value has more than one digit, continue reducing\n in this way until a single-digit number is produced. This\n is only applicable to the natural numbers.\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":2,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"42d91b41703125e1.json","parameterValues":[]} \ No newline at end of file +{"uid":"3ceac2ca244e095b","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"3ceac2ca244e095b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f0e71551541527fc.json b/allure-report/data/test-cases/3cf8d83dbb2d66b5.json similarity index 65% rename from allure-report/data/test-cases/f0e71551541527fc.json rename to allure-report/data/test-cases/3cf8d83dbb2d66b5.json index 02d7cb27d8f..741a7dc5422 100644 --- a/allure-report/data/test-cases/f0e71551541527fc.json +++ b/allure-report/data/test-cases/3cf8d83dbb2d66b5.json @@ -1 +1 @@ -{"uid":"f0e71551541527fc","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724735128836,"stop":1724735128852,"duration":16},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"95ff64e2c1a83a10","name":"stdout","source":"95ff64e2c1a83a10.txt","type":"text/plain","size":2621}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"501c2967d3373bac","status":"passed","time":{"start":1724733473991,"stop":1724733473991,"duration":0}}],"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"f0e71551541527fc.json","parameterValues":[]} \ No newline at end of file +{"uid":"3cf8d83dbb2d66b5","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724735128836,"stop":1724735128852,"duration":16},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"839567f1e1e69ee5","name":"stdout","source":"839567f1e1e69ee5.txt","type":"text/plain","size":2621}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"41ca81ef54591f7f","status":"passed","time":{"start":1724733473991,"stop":1724733473991,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"f0e71551541527fc","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}}]},"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"3cf8d83dbb2d66b5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3e354a7b4ef8aa9f.json b/allure-report/data/test-cases/3e354a7b4ef8aa9f.json new file mode 100644 index 00000000000..7f5807bdeab --- /dev/null +++ b/allure-report/data/test-cases/3e354a7b4ef8aa9f.json @@ -0,0 +1 @@ +{"uid":"3e354a7b4ef8aa9f","name":"Non is expected","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_none","historyId":"262134764fa6664c0e3055da165452d3","time":{"start":1724733474647,"stop":1724733474663,"duration":16},"description":"\n If the whole array is consecutive then return\n null or Nothing or None.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bf32cb10b99852f","name":"stdout","source":"bf32cb10b99852f.txt","type":"text/plain","size":371}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"40b6991ee66facde.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/40cf8e66ad985f0e.json b/allure-report/data/test-cases/40cf8e66ad985f0e.json deleted file mode 100644 index ffdea66b1ad..00000000000 --- a/allure-report/data/test-cases/40cf8e66ad985f0e.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"40cf8e66ad985f0e","name":"'fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9e259e1fbcfa5f37","name":"stdout","source":"9e259e1fbcfa5f37.txt","type":"text/plain","size":611}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"40cf8e66ad985f0e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/501c2967d3373bac.json b/allure-report/data/test-cases/41ca81ef54591f7f.json similarity index 70% rename from allure-report/data/test-cases/501c2967d3373bac.json rename to allure-report/data/test-cases/41ca81ef54591f7f.json index 8c98ff4e151..89f6940f240 100644 --- a/allure-report/data/test-cases/501c2967d3373bac.json +++ b/allure-report/data/test-cases/41ca81ef54591f7f.json @@ -1 +1 @@ -{"uid":"501c2967d3373bac","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"edfc621ad66d7630","name":"stdout","source":"edfc621ad66d7630.txt","type":"text/plain","size":2621}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"501c2967d3373bac.json","parameterValues":[]} \ No newline at end of file +{"uid":"41ca81ef54591f7f","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3a9eebe7718e7480","name":"stdout","source":"3a9eebe7718e7480.txt","type":"text/plain","size":2621}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"41ca81ef54591f7f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/41efd0d786aed73.json b/allure-report/data/test-cases/41efd0d786aed73.json new file mode 100644 index 00000000000..33731f93b64 --- /dev/null +++ b/allure-report/data/test-cases/41efd0d786aed73.json @@ -0,0 +1 @@ +{"uid":"41efd0d786aed73","name":"Testing solve function","fullName":"kyu_6.casino_chips.test_solve.SolveTestCase#test_solve","historyId":"47a8a15643c132c9b9f0d902bcff28dd","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"90ef8c17370e6610","name":"stdout","source":"90ef8c17370e6610.txt","type":"text/plain","size":640}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":13,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"650faaf602cc8f99","status":"passed","time":{"start":1724733473093,"stop":1724733473093,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d1585e7c78fd8d06","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"41efd0d786aed73.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/42383b817b641e4e.json b/allure-report/data/test-cases/42383b817b641e4e.json new file mode 100644 index 00000000000..689d097f597 --- /dev/null +++ b/allure-report/data/test-cases/42383b817b641e4e.json @@ -0,0 +1 @@ +{"uid":"42383b817b641e4e","name":"Testing 'numericals' function","fullName":"kyu_6.numericals_of_string.test_numericals.NumericalsTestCase#test_numericals","historyId":"d2b4dccd0eb8dfd6ef62ac0349f0f6a7","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"description":"\n Testing 'numericals' function\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f56caa49d4564a64","name":"stdout","source":"f56caa49d4564a64.txt","type":"text/plain","size":524}],"parameters":[],"stepsCount":9,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Easy Diagonal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"1f1607dce833287a.json","parameterValues":[]} \ No newline at end of file +{"uid":"431c7499a8a042ca","name":"Testing easy_diagonal function","fullName":"kyu_6.easy_diagonal.test_diagonal.EasyDiagonalTestCase#test_easy_diagonal","historyId":"5d9c9166bf610b28a284723b5b23aab1","time":{"start":1724733473218,"stop":1724733473889,"duration":671},"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b8749033ef3225ff","name":"stdout","source":"b8749033ef3225ff.txt","type":"text/plain","size":524}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Easy Diagonal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"431c7499a8a042ca.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d8970eab34dca31f.json b/allure-report/data/test-cases/4458ac38c6c9a97c.json similarity index 72% rename from allure-report/data/test-cases/d8970eab34dca31f.json rename to allure-report/data/test-cases/4458ac38c6c9a97c.json index 02bbcf72937..8e93c966d10 100644 --- a/allure-report/data/test-cases/d8970eab34dca31f.json +++ b/allure-report/data/test-cases/4458ac38c6c9a97c.json @@ -1 +1 @@ -{"uid":"d8970eab34dca31f","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_test","historyId":"eb0582ce0674121869dd4f6fce46e7f3","time":{"start":1724733474538,"stop":1724733474538,"duration":0},"description":"\n 3 is not a square number\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Insert items to the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f64884da2dda6a3c","name":"stdout","source":"f64884da2dda6a3c.txt","type":"text/plain","size":261}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"fc816863f78bcd65.json","parameterValues":[]} \ No newline at end of file +{"uid":"474af6c568bdf675","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Insert items to the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"41c90fa760e8d420","name":"stdout","source":"41c90fa760e8d420.txt","type":"text/plain","size":261}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"474af6c568bdf675.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a1830f831e47cf3a.json b/allure-report/data/test-cases/4783529dae6eb3af.json similarity index 79% rename from allure-report/data/test-cases/a1830f831e47cf3a.json rename to allure-report/data/test-cases/4783529dae6eb3af.json index d3a4eb91fea..10f2226ddf1 100644 --- a/allure-report/data/test-cases/a1830f831e47cf3a.json +++ b/allure-report/data/test-cases/4783529dae6eb3af.json @@ -1 +1 @@ -{"uid":"a1830f831e47cf3a","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"a1830f831e47cf3a.json","parameterValues":[]} \ No newline at end of file +{"uid":"4783529dae6eb3af","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"4783529dae6eb3af.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/af2006fa8ad3035d.json b/allure-report/data/test-cases/47a613697aa0c71f.json similarity index 93% rename from allure-report/data/test-cases/af2006fa8ad3035d.json rename to allure-report/data/test-cases/47a613697aa0c71f.json index 3030fe2230f..88a7296e1d0 100644 --- a/allure-report/data/test-cases/af2006fa8ad3035d.json +++ b/allure-report/data/test-cases/47a613697aa0c71f.json @@ -1 +1 @@ -{"uid":"af2006fa8ad3035d","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"af2006fa8ad3035d.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"47a613697aa0c71f","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"47a613697aa0c71f.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/409595d25cc5d60c.json b/allure-report/data/test-cases/47f8df09a84d8337.json
similarity index 66%
rename from allure-report/data/test-cases/409595d25cc5d60c.json
rename to allure-report/data/test-cases/47f8df09a84d8337.json
index 722c3db5c45..f7a836a8cc2 100644
--- a/allure-report/data/test-cases/409595d25cc5d60c.json
+++ b/allure-report/data/test-cases/47f8df09a84d8337.json
@@ -1 +1 @@
-{"uid":"409595d25cc5d60c","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2ec0e0654514a566","name":"stdout","source":"2ec0e0654514a566.txt","type":"text/plain","size":1515}],"parameters":[],"stepsCount":13,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Human readable duration format"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9f53adfade05c52d","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"409595d25cc5d60c.json","parameterValues":[]} \ No newline at end of file +{"uid":"47f8df09a84d8337","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6c919aa9e8f6951e","name":"stdout","source":"6c919aa9e8f6951e.txt","type":"text/plain","size":1515}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":13,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Human readable duration format"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d5804044d1767680","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"409595d25cc5d60c","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"47f8df09a84d8337.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7f4f9e94ec6d4f1e.json b/allure-report/data/test-cases/490cf50ddd5cff83.json similarity index 60% rename from allure-report/data/test-cases/7f4f9e94ec6d4f1e.json rename to allure-report/data/test-cases/490cf50ddd5cff83.json index 10ff6cb5c83..5f0007be280 100644 --- a/allure-report/data/test-cases/7f4f9e94ec6d4f1e.json +++ b/allure-report/data/test-cases/490cf50ddd5cff83.json @@ -1 +1 @@ -{"uid":"7f4f9e94ec6d4f1e","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724735129008,"stop":1724735129024,"duration":16},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f061bc52b29fdec3","name":"stdout","source":"f061bc52b29fdec3.txt","type":"text/plain","size":167}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"bbfb47c5ac3f243c","status":"passed","time":{"start":1724733474163,"stop":1724733474163,"duration":0}}],"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"7f4f9e94ec6d4f1e.json","parameterValues":[]} \ No newline at end of file +{"uid":"490cf50ddd5cff83","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724735129008,"stop":1724735129024,"duration":16},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d789b0e2f7ac3471","name":"stdout","source":"d789b0e2f7ac3471.txt","type":"text/plain","size":167}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"91e2410535ccc997","status":"passed","time":{"start":1724733474163,"stop":1724733474163,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7f4f9e94ec6d4f1e","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"490cf50ddd5cff83.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cf2907457d950935.json b/allure-report/data/test-cases/4979ee3063a87441.json similarity index 72% rename from allure-report/data/test-cases/cf2907457d950935.json rename to allure-report/data/test-cases/4979ee3063a87441.json index c450f0d52f4..73027ab3a02 100644 --- a/allure-report/data/test-cases/cf2907457d950935.json +++ b/allure-report/data/test-cases/4979ee3063a87441.json @@ -1 +1 @@ -{"uid":"cf2907457d950935","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5a6a1d1be82c27c9","name":"stdout","source":"5a6a1d1be82c27c9.txt","type":"text/plain","size":428}],"parameters":[],"stepsCount":9,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Factorial"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"cf2907457d950935.json","parameterValues":[]} \ No newline at end of file +{"uid":"4979ee3063a87441","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"db194e9e67e4f8fb","name":"stdout","source":"db194e9e67e4f8fb.txt","type":"text/plain","size":428}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Factorial"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"4979ee3063a87441.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/281344c06cab651e.json b/allure-report/data/test-cases/49aa5cc4276ca55b.json similarity index 66% rename from allure-report/data/test-cases/281344c06cab651e.json rename to allure-report/data/test-cases/49aa5cc4276ca55b.json index 4996c72852f..f4858a7f4ea 100644 --- a/allure-report/data/test-cases/281344c06cab651e.json +++ b/allure-report/data/test-cases/49aa5cc4276ca55b.json @@ -1 +1 @@ -{"uid":"281344c06cab651e","name":"Testing 'sum_triangular_numbers' with positive numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_positive_numbers","historyId":"135e62f837ca5fe30ddfd2ad875e089b","time":{"start":1724735129305,"stop":1724735129305,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with positive numbers\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Remove items from the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ebf0cbf302079de1","name":"stdout","source":"ebf0cbf302079de1.txt","type":"text/plain","size":254}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b3ab40391b5da28d","status":"passed","time":{"start":1724733473171,"stop":1724733473186,"duration":15}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"43c0068fe0a1265e.json","parameterValues":[]} \ No newline at end of file +{"uid":"51a9aec46de8d878","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1724735128063,"stop":1724735128078,"duration":15},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Remove items from the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c3d16eb9cb3b239c","name":"stdout","source":"c3d16eb9cb3b239c.txt","type":"text/plain","size":254}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a4b7cb6ba7726224","status":"passed","time":{"start":1724733473171,"stop":1724733473186,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"43c0068fe0a1265e","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"51a9aec46de8d878.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/de314943cf5bdd10.json b/allure-report/data/test-cases/52187b3daff300ae.json similarity index 59% rename from allure-report/data/test-cases/de314943cf5bdd10.json rename to allure-report/data/test-cases/52187b3daff300ae.json index cf0717327ea..f65cc4e16cb 100644 --- a/allure-report/data/test-cases/de314943cf5bdd10.json +++ b/allure-report/data/test-cases/52187b3daff300ae.json @@ -1 +1 @@ -{"uid":"de314943cf5bdd10","name":"AND logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_and","historyId":"49af4a8ebdc007fac4acbc085138b80e","time":{"start":1724735129586,"stop":1724735129586,"duration":0},"description":"\n And (∧) is the truth-functional\n operator of logical conjunction\n\n The and of a set of operands is true\n if and only if all of its operands are true.\n\n Source:\n https://en.wikipedia.org/wiki/Logical_conjunction\n\n :return:\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"b9d1131297f0da2f","name":"stdout","source":"b9d1131297f0da2f.txt","type":"text/plain","size":882}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"77d55c76ce916d94.json","parameterValues":[]} \ No newline at end of file +{"uid":"55d1d73293e16236","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9e063e588b090ea7","name":"stdout","source":"9e063e588b090ea7.txt","type":"text/plain","size":882}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"55d1d73293e16236.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5653676293d9b683.json b/allure-report/data/test-cases/5653676293d9b683.json deleted file mode 100644 index ee995c695de..00000000000 --- a/allure-report/data/test-cases/5653676293d9b683.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"5653676293d9b683","name":"Testing to_alternating_case function","fullName":"kyu_8.alternating_case.test_alternating_case.AlternatingCaseTestCase#test_alternating_case","historyId":"470b5bb32c448e7433bb94b222d4d8b0","time":{"start":1724735129367,"stop":1724735129383,"duration":16},"description":"\n Testing to_alternating_case function\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"76ccf3919bc3e5ff","name":"stdout","source":"76ccf3919bc3e5ff.txt","type":"text/plain","size":1536}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"27163d5f2266ba73","status":"passed","time":{"start":1724733474054,"stop":1724733474054,"duration":0}}],"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"578c3a6cd3e7e40f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/84ae1ddd95d9c6d3.json b/allure-report/data/test-cases/57efbea0ccf3907a.json similarity index 66% rename from allure-report/data/test-cases/84ae1ddd95d9c6d3.json rename to allure-report/data/test-cases/57efbea0ccf3907a.json index 07ed0a52825..c1ac9d8be26 100644 --- a/allure-report/data/test-cases/84ae1ddd95d9c6d3.json +++ b/allure-report/data/test-cases/57efbea0ccf3907a.json @@ -1 +1 @@ -{"uid":"84ae1ddd95d9c6d3","name":"Testing flatten function","fullName":"kyu_5.flatten.test_flatten.FlattenTestCase#test_flatten","historyId":"bf9ab588ec37b96b09a8d0c56f74fc4a","time":{"start":1724735127672,"stop":1724735127672,"duration":0},"description":"\n For this exercise you will create a global flatten method.\n The method takes in any number of arguments and flattens\n them into a single array. If any of the arguments passed in\n are an array then the individual objects within the array\n will be flattened so that they exist at the same level as\n the other arguments. Any nested arrays, no matter how deep,\n should be flattened into the single array result.\n\n The following are examples of how this function would be\n used and what the expected results would be:\n\n flatten(1, [2, 3], 4, 5, [6, [7]]) # returns [1, 2, 3, 4, 5, 6, 7]\n flatten('a', ['b', 2], 3, None, [[4], ['c']]) # returns ['a', 'b', 2, 3, None, 4, 'c']\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724735127938,"stop":1724735127938,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ce9018a625502a4f","name":"stdout","source":"ce9018a625502a4f.txt","type":"text/plain","size":318}],"parameters":[],"stepsCount":7,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c2e82f2f4bdc38ce","status":"passed","time":{"start":1724733473046,"stop":1724733473061,"duration":15}}],"categories":[],"tags":["FUNDAMENTALS"]},"source":"66f1b8d1e5ed1dbe.json","parameterValues":[]} \ No newline at end of file +{"uid":"585949d19b46a5d2","name":"Testing 'thirt' function","fullName":"kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase#test_thirt","historyId":"b223f14337b9b49b6e64d94d9479e857","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724735127938,"stop":1724735127938,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d1528cec1dd8dea3","name":"stdout","source":"d1528cec1dd8dea3.txt","type":"text/plain","size":318}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2cfa19c331ab824b","status":"passed","time":{"start":1724733473046,"stop":1724733473061,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"66f1b8d1e5ed1dbe","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"585949d19b46a5d2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9bf22c06763280e5.json b/allure-report/data/test-cases/587ebae959bb9619.json similarity index 72% rename from allure-report/data/test-cases/9bf22c06763280e5.json rename to allure-report/data/test-cases/587ebae959bb9619.json index 01fc9daeebf..f223a679d4d 100644 --- a/allure-report/data/test-cases/9bf22c06763280e5.json +++ b/allure-report/data/test-cases/587ebae959bb9619.json @@ -1 +1 @@ -{"uid":"9bf22c06763280e5","name":"Testing max_multiple function","fullName":"kyu_7.maximum_multiple.test_maximum_multiple.MaximumMultipleTestCase#test_maximum_multiple","historyId":"3181c0c2e1c9ba7b49a9f72369c7b0bb","time":{"start":1724733474335,"stop":1724733474335,"duration":0},"description":"\n Testing max_multiple function with\n various test data\n\n :return:\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e25ec87c38eb56d7","name":"stdout","source":"e25ec87c38eb56d7.txt","type":"text/plain","size":530}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"828252a14a7968ec.json","parameterValues":[]} \ No newline at end of file +{"uid":"58ec93395b112a8f","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"60434b32a4fa91ba","name":"stdout","source":"60434b32a4fa91ba.txt","type":"text/plain","size":530}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"58ec93395b112a8f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/59863a86bad45fb3.json b/allure-report/data/test-cases/59863a86bad45fb3.json new file mode 100644 index 00000000000..1a58c2da747 --- /dev/null +++ b/allure-report/data/test-cases/59863a86bad45fb3.json @@ -0,0 +1 @@ +{"uid":"59863a86bad45fb3","name":"Testing 'has_subpattern' (part 3) function","fullName":"kyu_6.string_subpattern_recognition_3.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"89f53112353ba49dc8f3a4029d39ba34","time":{"start":1724735128946,"stop":1724735128946,"duration":0},"description":"\n Verify that 'has_subpattern' function\n\n Return a subpattern with sorted characters,\n otherwise return the base string with sorted\n characters (you might consider this case as\n an edge case, with the subpattern being repeated\n only once and thus equalling the original input string).\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8c7dbf4edab807e9","name":"stdout","source":"8c7dbf4edab807e9.txt","type":"text/plain","size":304}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1c1ac4b8936ce5ba","status":"passed","time":{"start":1724733474210,"stop":1724733474210,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"5ef0ca25b0e8e9c5.json","parameterValues":[]} \ No newline at end of file +{"uid":"5a941d3b90762a67","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"edbe93ce737c702f","name":"stdout","source":"edbe93ce737c702f.txt","type":"text/plain","size":304}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"db267da7b8a1b004","status":"passed","time":{"start":1724733474210,"stop":1724733474210,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"5ef0ca25b0e8e9c5","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"5a941d3b90762a67.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5ae2799c264c377c.json b/allure-report/data/test-cases/5ae2799c264c377c.json deleted file mode 100644 index 69d9091f5f8..00000000000 --- a/allure-report/data/test-cases/5ae2799c264c377c.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"5ae2799c264c377c","name":"Testing permute_a_palindrome (negative)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_negative","historyId":"7090b58c62fab362ad673c85c67765af","time":{"start":1724733474007,"stop":1724733474007,"duration":0},"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1f77a5204398ee70","name":"stdout","source":"1f77a5204398ee70.txt","type":"text/plain","size":1380}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ASCII"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Character Encodings"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BINARY"},{"name":"tag","value":"FORMATS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"39e365f7b1aa879c","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"tags":["CHARACTER ENCODINGS","STRINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"5c281d5272513bfd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/673535ed619b4051.json b/allure-report/data/test-cases/5d080f15b08c0b4f.json similarity index 56% rename from allure-report/data/test-cases/673535ed619b4051.json rename to allure-report/data/test-cases/5d080f15b08c0b4f.json index 3703da5a008..2d33b366dc0 100644 --- a/allure-report/data/test-cases/673535ed619b4051.json +++ b/allure-report/data/test-cases/5d080f15b08c0b4f.json @@ -1 +1 @@ -{"uid":"673535ed619b4051","name":"'multiply' function verification with random list","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest_random_list","historyId":"be99c6f72cdf623836966737dcb7a654","time":{"start":1724733474397,"stop":1724733474397,"duration":0},"description":"\n Returns a list that misses only one element\n :return:\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5a9323196c3e301a","name":"stdout","source":"5a9323196c3e301a.txt","type":"text/plain","size":3898}],"parameters":[],"stepsCount":9,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"79507cba518971f8","status":"passed","time":{"start":1724733472296,"stop":1724733472296,"duration":0}}],"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"36b9e5073b489f49.json","parameterValues":[]} \ No newline at end of file +{"uid":"5dad026541a05e65","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e46ecdc21febfa2d","name":"stdout","source":"e46ecdc21febfa2d.txt","type":"text/plain","size":3898}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b99ca9a8ecf19524","status":"passed","time":{"start":1724733472296,"stop":1724733472296,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"36b9e5073b489f49","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}}]},"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"5dad026541a05e65.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4ab943002f86b4e6.json b/allure-report/data/test-cases/5de6808258f0151f.json similarity index 71% rename from allure-report/data/test-cases/4ab943002f86b4e6.json rename to allure-report/data/test-cases/5de6808258f0151f.json index 3042c80a9df..c08cfaab863 100644 --- a/allure-report/data/test-cases/4ab943002f86b4e6.json +++ b/allure-report/data/test-cases/5de6808258f0151f.json @@ -1 +1 @@ -{"uid":"4ab943002f86b4e6","name":"Testing first_non_repeated function with various inputs","fullName":"kyu_7.the_first_non_repeated_character_in_string.test_first_non_repeated.FirstNonRepeatedTestCase#test_first_non_repeated","historyId":"9398abf0c9f75b70331fc87dcc2b8a7f","time":{"start":1724733474507,"stop":1724733474507,"duration":0},"description":"\n Testing first_non_repeated function\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"suite","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Potion Class 101"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"46081367fb92978f.json","parameterValues":[]} \ No newline at end of file +{"uid":"5e4b4c0a3aeae99e","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"suite","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Potion Class 101"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"5e4b4c0a3aeae99e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d65c16a1b47d468e.json b/allure-report/data/test-cases/5e6aa533c6c0fafa.json similarity index 74% rename from allure-report/data/test-cases/d65c16a1b47d468e.json rename to allure-report/data/test-cases/5e6aa533c6c0fafa.json index 9f8a7dbf80d..4e589eda29d 100644 --- a/allure-report/data/test-cases/d65c16a1b47d468e.json +++ b/allure-report/data/test-cases/5e6aa533c6c0fafa.json @@ -1 +1 @@ -{"uid":"d65c16a1b47d468e","name":"Testing dirReduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"65e8f59235ab8ed3","name":"stdout","source":"65e8f59235ab8ed3.txt","type":"text/plain","size":204}],"parameters":[],"stepsCount":2,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a9fa2bf5091c83a","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS"]},"source":"d65c16a1b47d468e.json","parameterValues":[]} \ No newline at end of file +{"uid":"5e6aa533c6c0fafa","name":"Testing dirReduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3dc83265322e5aba","name":"stdout","source":"3dc83265322e5aba.txt","type":"text/plain","size":204}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"aefb4681bbbff0c9","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d65c16a1b47d468e","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"5e6aa533c6c0fafa.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5e8c0121e99e8c0.json b/allure-report/data/test-cases/5e8c0121e99e8c0.json deleted file mode 100644 index 3ed41151acc..00000000000 --- a/allure-report/data/test-cases/5e8c0121e99e8c0.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"5e8c0121e99e8c0","name":"Testing check_for_factor function: positive flow","fullName":"kyu_8.grasshopper_check_for_factor.test_check_for_factor.CheckForFactorTestCase#test_check_for_factor_false","historyId":"8c287dae332df512fc4a9755020ffedc","time":{"start":1724735129477,"stop":1724735129477,"duration":0},"description":"\n Testing check_for_factor function.\n\n This function should test if the\n factor is a factor of base.\n\n Return false if it is not a factor.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1dd67237b9ff3f68","name":"stdout","source":"1dd67237b9ff3f68.txt","type":"text/plain","size":326}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"451dd55d479da390","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"tags":["ALGORITHMS"]},"source":"e798d2f5cc38e024.json","parameterValues":[]} \ No newline at end of file +{"uid":"614b9e2de4457676","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a5a1e9dabd89620f","name":"stdout","source":"a5a1e9dabd89620f.txt","type":"text/plain","size":326}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8f884e4fa29bb7d4","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"e798d2f5cc38e024","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"614b9e2de4457676.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7ba8a4247f4c6307.json b/allure-report/data/test-cases/616180d049b16d1d.json similarity index 58% rename from allure-report/data/test-cases/7ba8a4247f4c6307.json rename to allure-report/data/test-cases/616180d049b16d1d.json index f4c8180a084..56c9338e4ea 100644 --- a/allure-report/data/test-cases/7ba8a4247f4c6307.json +++ b/allure-report/data/test-cases/616180d049b16d1d.json @@ -1 +1 @@ -{"uid":"7ba8a4247f4c6307","name":"Testing 'letter_count' function","fullName":"kyu_6.count_letters_in_string.test_count_letters_in_string.CountLettersInStringTestCase#test_count_letters_in_string","historyId":"04bb543ec741bd163e341a33a1623692","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"description":"\n Testing 'letter_count' function\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"659fcb73d39cab15","name":"stdout","source":"659fcb73d39cab15.txt","type":"text/plain","size":263}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cf4cdc94d1e2968c","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"d8e9539521c4ca00.json","parameterValues":[]} \ No newline at end of file +{"uid":"627da61e5891aa44","name":"Testing domain_name function","fullName":"kyu_5.extract_the_domain_name_from_url.test_domain_name.DomainNameTestCase#test_domain_name","historyId":"cd64b52319d4c70d68e281e8561ab97f","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c126cf9c398e7752","name":"stdout","source":"c126cf9c398e7752.txt","type":"text/plain","size":263}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b5f6e3f148925a4f","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d8e9539521c4ca00","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"627da61e5891aa44.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/62e4f6698c2439c.json b/allure-report/data/test-cases/62e4f6698c2439c.json deleted file mode 100644 index f6ae85d3a33..00000000000 --- a/allure-report/data/test-cases/62e4f6698c2439c.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"62e4f6698c2439c","name":"String with no duplicate chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_dup_none","historyId":"a2426de0b4808429aff451df95bbdc21","time":{"start":1724735128789,"stop":1724735128789,"duration":0},"description":"\n Test string with no duplicate chars\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4617a41c1cef3094","name":"stdout","source":"4617a41c1cef3094.txt","type":"text/plain","size":562}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cb14dd2e679669bc","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"tags":["ALGORITHMS"]},"source":"34569132e9551c33.json","parameterValues":[]} \ No newline at end of file +{"uid":"645c6c05562d2f01","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1a6c1f836394adf7","name":"stdout","source":"1a6c1f836394adf7.txt","type":"text/plain","size":562}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a51a382d521d00cc","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"34569132e9551c33","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"645c6c05562d2f01.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8fac702aa93d2093.json b/allure-report/data/test-cases/64a44b1c9018ad85.json similarity index 58% rename from allure-report/data/test-cases/8fac702aa93d2093.json rename to allure-report/data/test-cases/64a44b1c9018ad85.json index 86e7fc01a54..036775b770f 100644 --- a/allure-report/data/test-cases/8fac702aa93d2093.json +++ b/allure-report/data/test-cases/64a44b1c9018ad85.json @@ -1 +1 @@ -{"uid":"8fac702aa93d2093","name":"Testing period_is_late function (positive)","fullName":"kyu_8.is_your_period_late.test_is_your_period_late.PeriodIsLateTestCase#test_period_is_late_positive","historyId":"763475007d09f077c2c251a191291e14","time":{"start":1724735129555,"stop":1724735129555,"duration":0},"description":"\n Positive tests\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bc5d49dc5212bf5e","name":"stdout","source":"bc5d49dc5212bf5e.txt","type":"text/plain","size":640}],"parameters":[],"stepsCount":13,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Casino chips"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"ebad35c5d56f477f.json","parameterValues":[]} \ No newline at end of file +{"uid":"650faaf602cc8f99","name":"Testing solve function","fullName":"kyu_6.casino_chips.test_solve.SolveTestCase#test_solve","historyId":"47a8a15643c132c9b9f0d902bcff28dd","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fcab257bac252f0f","name":"stdout","source":"fcab257bac252f0f.txt","type":"text/plain","size":640}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":13,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Casino chips"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"650faaf602cc8f99.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2fc3a43f4af43f00.json b/allure-report/data/test-cases/6566b62febd2f997.json similarity index 72% rename from allure-report/data/test-cases/2fc3a43f4af43f00.json rename to allure-report/data/test-cases/6566b62febd2f997.json index 587fa6a8388..73ab57db222 100644 --- a/allure-report/data/test-cases/2fc3a43f4af43f00.json +++ b/allure-report/data/test-cases/6566b62febd2f997.json @@ -1 +1 @@ -{"uid":"2fc3a43f4af43f00","name":"Testing to_alternating_case function","fullName":"kyu_8.alternating_case.test_alternating_case.AlternatingCaseTestCase#test_alternating_case","historyId":"470b5bb32c448e7433bb94b222d4d8b0","time":{"start":1724733474554,"stop":1724733474554,"duration":0},"description":"\n Testing to_alternating_case function\n :return:\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cbe62037cd68092f","name":"stdout","source":"cbe62037cd68092f.txt","type":"text/plain","size":67}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"47c7c905d0e48c01","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"c1f2317d20109e13.json","parameterValues":[]} \ No newline at end of file +{"uid":"675849fee1009391","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fec67c535945138b","name":"stdout","source":"fec67c535945138b.txt","type":"text/plain","size":67}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cabe377ec9af3c98","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"c1f2317d20109e13","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"675849fee1009391.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/68c4a39d8a6017b.json b/allure-report/data/test-cases/68c4a39d8a6017b.json new file mode 100644 index 00000000000..37b51f0c8b3 --- /dev/null +++ b/allure-report/data/test-cases/68c4a39d8a6017b.json @@ -0,0 +1 @@ +{"uid":"68c4a39d8a6017b","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"189c0101c5666165","name":"stdout","source":"189c0101c5666165.txt","type":"text/plain","size":3097}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"PARSING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"RANKING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"feature","value":"String"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"68c4a39d8a6017b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/693c5b2693478689.json b/allure-report/data/test-cases/693c5b2693478689.json new file mode 100644 index 00000000000..3ede8076832 --- /dev/null +++ b/allure-report/data/test-cases/693c5b2693478689.json @@ -0,0 +1 @@ +{"uid":"693c5b2693478689","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1724735127122,"stop":1724735127141,"duration":19},"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7517e0fe4fd38ce3","name":"stdout","source":"7517e0fe4fd38ce3.txt","type":"text/plain","size":1904}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":21,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"2 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a90fdb1fb3683308","status":"passed","time":{"start":1724733472280,"stop":1724733472280,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d6d06cbc227917e","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}}]},"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"693c5b2693478689.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5e4b0e05a0862f7e.json b/allure-report/data/test-cases/69f65011f131e2b6.json similarity index 65% rename from allure-report/data/test-cases/5e4b0e05a0862f7e.json rename to allure-report/data/test-cases/69f65011f131e2b6.json index 9b2f67b3fc1..21529e817f6 100644 --- a/allure-report/data/test-cases/5e4b0e05a0862f7e.json +++ b/allure-report/data/test-cases/69f65011f131e2b6.json @@ -1 +1 @@ -{"uid":"5e4b0e05a0862f7e","name":"Negative test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_negative","historyId":"4a2df53975623c10d30ec1c6932ba04a","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"29a496fd36abeefa","name":"stdout","source":"29a496fd36abeefa.txt","type":"text/plain","size":23}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"73e2d6b3532a4935","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"5e4b0e05a0862f7e.json","parameterValues":[]} \ No newline at end of file +{"uid":"69f65011f131e2b6","name":"Negative test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_negative","historyId":"4a2df53975623c10d30ec1c6932ba04a","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b653a3e02677ec62","name":"stdout","source":"b653a3e02677ec62.txt","type":"text/plain","size":23}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"6af8fedb1f0ef3c6","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"5e4b0e05a0862f7e","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"69f65011f131e2b6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6a1d96979e635e7f.json b/allure-report/data/test-cases/6a1d96979e635e7f.json new file mode 100644 index 00000000000..73fadddd7a7 --- /dev/null +++ b/allure-report/data/test-cases/6a1d96979e635e7f.json @@ -0,0 +1 @@ +{"uid":"6a1d96979e635e7f","name":"Testing 'save' function: positive","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_positive","historyId":"b1ff2214ba100eb1c8bc62e73e12889e","time":{"start":1724735129102,"stop":1724735129102,"duration":0},"description":"\n Testing 'save' function: positive\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"44675768f78eee8a","name":"stdout","source":"44675768f78eee8a.txt","type":"text/plain","size":2146}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Array to HTML table"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"9bb9bf100d008741.json","parameterValues":[]} \ No newline at end of file +{"uid":"6a793815cad01bd2","name":"Testing to_table function","fullName":"kyu_6.array_to_html_table.test_list_to_html_table.ArrayToTableTestCase#test_array_to_table_function","historyId":"d7b951f3d87d7ec30599f08ae5567eb7","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"da9065dd6d539fab","name":"stdout","source":"da9065dd6d539fab.txt","type":"text/plain","size":2146}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Array to HTML table"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"6a793815cad01bd2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ccf5a8c46639d0ec.json b/allure-report/data/test-cases/6ab6caccad49b468.json similarity index 64% rename from allure-report/data/test-cases/ccf5a8c46639d0ec.json rename to allure-report/data/test-cases/6ab6caccad49b468.json index c2834f4eef9..4cc9536ee89 100644 --- a/allure-report/data/test-cases/ccf5a8c46639d0ec.json +++ b/allure-report/data/test-cases/6ab6caccad49b468.json @@ -1 +1 @@ -{"uid":"ccf5a8c46639d0ec","name":"Find the int that appears an odd number of times","fullName":"kyu_6.find_the_odd_int.test_find_the_odd_int.FindTheOddIntTestCase#test_something","historyId":"0f9fe14df4043e3026ded68af344e3f2","time":{"start":1724735128774,"stop":1724735128774,"duration":0},"description":"\n Sample testing.\n Expected result is 5\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"80387d9cf50add05","name":"stdout","source":"80387d9cf50add05.txt","type":"text/plain","size":23}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"73e2d6b3532a4935.json","parameterValues":[]} \ No newline at end of file +{"uid":"6af8fedb1f0ef3c6","name":"Negative test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_negative","historyId":"4a2df53975623c10d30ec1c6932ba04a","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b9b05bf139af2d32","name":"stdout","source":"b9b05bf139af2d32.txt","type":"text/plain","size":23}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"6af8fedb1f0ef3c6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/918346e849cd43c1.json b/allure-report/data/test-cases/6b00dc7a9142ab25.json similarity index 85% rename from allure-report/data/test-cases/918346e849cd43c1.json rename to allure-report/data/test-cases/6b00dc7a9142ab25.json index e14c8b549ba..c9a5b609276 100644 --- a/allure-report/data/test-cases/918346e849cd43c1.json +++ b/allure-report/data/test-cases/6b00dc7a9142ab25.json @@ -1 +1 @@ -{"uid":"918346e849cd43c1","name":"Testing growing_plant function","fullName":"kyu_7.growing_plant.test_growing_plant.GrowingPlantTestCase#test_growing_plant","historyId":"ed63cab09a5a21abc4139e6751f28e54","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"description":"\n Testing growing_plant function\n\n Task\n\n Each day a plant is growing by upSpeed meters.\n Each night that plant's height decreases by downSpeed\n meters due to the lack of sun heat. Initially, plant\n is 0 meters tall. We plant the seed at the beginning\n of a day. We want to know when the height of the plant\n will reach a certain level.\n\n Example\n\n For upSpeed = 100, downSpeed = 10 and desiredHeight = 910,\n the output should be 10.\n\n For upSpeed = 10, downSpeed = 9 and desiredHeight = 4,\n the output should be 1. Because the plant reach to the desired\n height at day 1(10 meters).\n\n Input/Output\n\n [input] integer upSpeed\n A positive integer representing the daily growth.\n Constraints: 5 ≤ upSpeed ≤ 100.\n\n [input] integer downSpeed\n A positive integer representing the nightly decline.\n Constraints: 2 ≤ downSpeed < upSpeed.\n\n [input] integer desiredHeight\n A positive integer representing the threshold.\n Constraints: 4 ≤ desiredHeight ≤ 1000.\n\n [output] an integer\n\n The number of days that it will take for the plant to\n reach/pass desiredHeight (including the last day in the\n total count).\n ","descriptionHtml":" Advanced/random test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Advanced/random test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c91447e2ab5b5752","name":"stdout","source":"c91447e2ab5b5752.txt","type":"text/plain","size":791}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"tags":["Algorithms","Logic","Strings"]},"source":"a83637127d81f7d9.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"6c1504a4fcfadf69","name":"test_random","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_random","historyId":"f9568f445cf6471d62f38f61a6e1887d","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"description":"\n Advanced/random test case\n :return:\n ","descriptionHtml":" Advanced/random test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Advanced/random test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f26281521e32f10c","name":"stdout","source":"f26281521e32f10c.txt","type":"text/plain","size":791}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"a83637127d81f7d9","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"6c1504a4fcfadf69.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/6c5d99461aa2603.json b/allure-report/data/test-cases/6c5d99461aa2603.json
deleted file mode 100644
index c9a6abf5020..00000000000
--- a/allure-report/data/test-cases/6c5d99461aa2603.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"6c5d99461aa2603","name":"Testing invite_more_women function (negative)","fullName":"kyu_7.simple_fun_152.test_invite_more_women.InviteMoreWomenTestCase#test_invite_more_women_negative","historyId":"439816a19ff5fc7179df296b3e238bad","time":{"start":1724735129242,"stop":1724735129242,"duration":0},"description":"\n Simple Fun #152: Invite More Women?\n Testing invite_more_women function (negative)\n :return:\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"eb842e833e18e0a2","name":"stdout","source":"eb842e833e18e0a2.txt","type":"text/plain","size":277}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"77e7a047aea456b4","status":"passed","time":{"start":1724733473030,"stop":1724733473030,"duration":0}}],"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"63cbfe00daba1c69.json","parameterValues":[]} \ No newline at end of file +{"uid":"6cad203fab564c60","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"ac68097df5e78e9a","name":"stdout","source":"ac68097df5e78e9a.txt","type":"text/plain","size":277}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e41551e078ed42ea","status":"passed","time":{"start":1724733473030,"stop":1724733473030,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"63cbfe00daba1c69","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}}]},"tags":["ARRAY","ALGORITHMS"]},"source":"6cad203fab564c60.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1e32519d766f390f.json b/allure-report/data/test-cases/6d22e154a5a83d80.json similarity index 71% rename from allure-report/data/test-cases/1e32519d766f390f.json rename to allure-report/data/test-cases/6d22e154a5a83d80.json index c3b32557363..0b0db2d2d57 100644 --- a/allure-report/data/test-cases/1e32519d766f390f.json +++ b/allure-report/data/test-cases/6d22e154a5a83d80.json @@ -1 +1 @@ -{"uid":"1e32519d766f390f","name":"Negative numbers","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_numbers","historyId":"baeb278025592b3aed00b5f1bc1265b1","time":{"start":1724733474538,"stop":1724733474538,"duration":0},"description":"\n -1: Negative numbers cannot be square numbers\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"fdeff84d2ee8d5a7","name":"stdout","source":"fdeff84d2ee8d5a7.txt","type":"text/plain","size":502}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"960c8899017a5d3c.json","parameterValues":[]} \ No newline at end of file +{"uid":"6fce95111dc1cc14","name":"Testing array_diff function","fullName":"kyu_6.array_diff.test_array_diff.ArrayDiffTestCase#test_array_diff_function","historyId":"5e365f66b39a2fede4fe18a5cc569699","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f8b4598a501c7d27","name":"stdout","source":"f8b4598a501c7d27.txt","type":"text/plain","size":502}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"6fce95111dc1cc14.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a5e3b3442b4ab9dd.json b/allure-report/data/test-cases/70085274c959a3cb.json similarity index 61% rename from allure-report/data/test-cases/a5e3b3442b4ab9dd.json rename to allure-report/data/test-cases/70085274c959a3cb.json index 5d7cf255170..2ce5bed6756 100644 --- a/allure-report/data/test-cases/a5e3b3442b4ab9dd.json +++ b/allure-report/data/test-cases/70085274c959a3cb.json @@ -1 +1 @@ -{"uid":"a5e3b3442b4ab9dd","name":"Testing largestPower function","fullName":"kyu_7.powers_of_3.test_largest_power.LargestPowerTestCase#test_largest_power","historyId":"026739760bca73e921f8e5d35d9329cf","time":{"start":1724735129196,"stop":1724735129196,"duration":0},"description":"\n Testing largestPower function\n :return:\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert training","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert battle","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f04c5edec457b138","name":"stdout","source":"f04c5edec457b138.txt","type":"text/plain","size":67}],"parameters":[],"stepsCount":12,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"b8d68faa427e9f9d.json","parameterValues":[]} \ No newline at end of file +{"uid":"72010ab4f2692ae4","name":"Testing Warrior class >>> bruce_lee","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_bruce_lee","historyId":"7af7e9479cf2a47a636ae35231bacc9f","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert training","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert battle","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8b00f3eb19799549","name":"stdout","source":"8b00f3eb19799549.txt","type":"text/plain","size":67}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":12,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"72010ab4f2692ae4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/654b50568a4f83a1.json b/allure-report/data/test-cases/743e871493ba28b4.json similarity index 69% rename from allure-report/data/test-cases/654b50568a4f83a1.json rename to allure-report/data/test-cases/743e871493ba28b4.json index ec1a358eb62..1a49a9f3b0c 100644 --- a/allure-report/data/test-cases/654b50568a4f83a1.json +++ b/allure-report/data/test-cases/743e871493ba28b4.json @@ -1 +1 @@ -{"uid":"654b50568a4f83a1","name":"All chars are in mixed case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_mixed","historyId":"d4bb68fb8c0e59fc03fed525cca43eb5","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in mixed case\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"336614ff4bde976d","name":"stdout","source":"336614ff4bde976d.txt","type":"text/plain","size":878}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"761811e55728ed74.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8fbe4fcea83005e2.json b/allure-report/data/test-cases/7637c123d5cf58af.json similarity index 70% rename from allure-report/data/test-cases/8fbe4fcea83005e2.json rename to allure-report/data/test-cases/7637c123d5cf58af.json index d0e90adda79..79e9929497c 100644 --- a/allure-report/data/test-cases/8fbe4fcea83005e2.json +++ b/allure-report/data/test-cases/7637c123d5cf58af.json @@ -1 +1 @@ -{"uid":"8fbe4fcea83005e2","name":"Testing 'longest_repetition' function","fullName":"kyu_6.longest_repetition.test_longest_repetition.LongestRepetitionTestCase#test_longest_repetition","historyId":"6431e0366c9c302e03ac01343fb7ea77","time":{"start":1724733473976,"stop":1724733473976,"duration":0},"description":"\n For a given string s find the character c (or C) with\n longest consecutive repetition and return: (c, l)\n where l (or L) is the length of the repetition.\n\n For empty string return: ('', 0)\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ab818dba8f721c82","name":"stdout","source":"ab818dba8f721c82.txt","type":"text/plain","size":434}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2993b93df714aac2","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"db7b4c897ddcf1a6.json","parameterValues":[]} \ No newline at end of file +{"uid":"7b2352a8e3675c67","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5c7638f94c1897db","name":"stdout","source":"5c7638f94c1897db.txt","type":"text/plain","size":434}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9035abe5e1151932","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"db7b4c897ddcf1a6","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}}]},"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"7b2352a8e3675c67.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ad991ec2a2bdb70.json b/allure-report/data/test-cases/7b9876690035f17.json similarity index 68% rename from allure-report/data/test-cases/ad991ec2a2bdb70.json rename to allure-report/data/test-cases/7b9876690035f17.json index 06c30d07b75..1a1629f4efb 100644 --- a/allure-report/data/test-cases/ad991ec2a2bdb70.json +++ b/allure-report/data/test-cases/7b9876690035f17.json @@ -1 +1 @@ -{"uid":"ad991ec2a2bdb70","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"afd9bf5ba31b7f2c","name":"stdout","source":"afd9bf5ba31b7f2c.txt","type":"text/plain","size":1009}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"Snail"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"ad991ec2a2bdb70.json","parameterValues":[]} \ No newline at end of file +{"uid":"7b9876690035f17","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7f52a9aa50bef455","name":"stdout","source":"7f52a9aa50bef455.txt","type":"text/plain","size":1009}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"Snail"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"7b9876690035f17.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/85d9d1820cce2f7e.json b/allure-report/data/test-cases/7c2750d825fae93b.json similarity index 67% rename from allure-report/data/test-cases/85d9d1820cce2f7e.json rename to allure-report/data/test-cases/7c2750d825fae93b.json index b0faf05d4b5..4f132457cc7 100644 --- a/allure-report/data/test-cases/85d9d1820cce2f7e.json +++ b/allure-report/data/test-cases/7c2750d825fae93b.json @@ -1 +1 @@ -{"uid":"85d9d1820cce2f7e","name":"Wolf in the middle of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_in_middle","historyId":"3de540be96edd1a6ef052fccdb3f5cad","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"description":"\n If the wolf is the closest animal to you,\n return \"Pls go away and stop eating my sheep\".\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"314ae6d54cae55b6","name":"stdout","source":"314ae6d54cae55b6.txt","type":"text/plain","size":1079}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"Strings"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Logic"},{"name":"tag","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"tags":["Algorithms","Logic","Strings"]},"source":"2d65aaadaa20d5c2.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"7e0d94f0ee4e397d","name":"test_triangle","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_triangle","historyId":"be7068cb1056118b9c0776b1d187601d","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"676a2b28cd4ab614","name":"stdout","source":"676a2b28cd4ab614.txt","type":"text/plain","size":1079}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"Strings"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Logic"},{"name":"tag","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"2d65aaadaa20d5c2","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"7e0d94f0ee4e397d.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/7f2ec06c200d3086.json b/allure-report/data/test-cases/7f2ec06c200d3086.json
deleted file mode 100644
index f673955646b..00000000000
--- a/allure-report/data/test-cases/7f2ec06c200d3086.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"7f2ec06c200d3086","name":"Testing easy_diagonal function","fullName":"kyu_6.easy_diagonal.test_diagonal.EasyDiagonalTestCase#test_easy_diagonal","historyId":"5d9c9166bf610b28a284723b5b23aab1","time":{"start":1724735128094,"stop":1724735128742,"duration":648},"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"52487ab63cfc7fc2","name":"stdout","source":"52487ab63cfc7fc2.txt","type":"text/plain","size":524}],"parameters":[],"stepsCount":9,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Diagonal"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1f1607dce833287a","status":"passed","time":{"start":1724733473218,"stop":1724733473889,"duration":671}}],"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"7f2ec06c200d3086.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a921030da8c9a520.json b/allure-report/data/test-cases/7f90afc62f8400f4.json similarity index 52% rename from allure-report/data/test-cases/a921030da8c9a520.json rename to allure-report/data/test-cases/7f90afc62f8400f4.json index dd812bce856..8a91257c51b 100644 --- a/allure-report/data/test-cases/a921030da8c9a520.json +++ b/allure-report/data/test-cases/7f90afc62f8400f4.json @@ -1 +1 @@ -{"uid":"a921030da8c9a520","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c243a724cee6015a","name":"stdout","source":"c243a724cee6015a.txt","type":"text/plain","size":2817}],"parameters":[],"stepsCount":30,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"GAMES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"502fa7fe3b72cd9a","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"a921030da8c9a520.json","parameterValues":[]} \ No newline at end of file +{"uid":"7f90afc62f8400f4","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c6d99744fc651725","name":"stdout","source":"c6d99744fc651725.txt","type":"text/plain","size":2817}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":30,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"GAMES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a97caba53074497b","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"a921030da8c9a520","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}}]},"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"7f90afc62f8400f4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7fad3735c185529a.json b/allure-report/data/test-cases/7fad3735c185529a.json deleted file mode 100644 index bd409e8fb1c..00000000000 --- a/allure-report/data/test-cases/7fad3735c185529a.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"7fad3735c185529a","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7e845202c63af573","name":"stdout","source":"7e845202c63af573.txt","type":"text/plain","size":554}],"parameters":[],"stepsCount":10,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"7fad3735c185529a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/60f5877935ced5c5.json b/allure-report/data/test-cases/7fd5632b0213855d.json similarity index 60% rename from allure-report/data/test-cases/60f5877935ced5c5.json rename to allure-report/data/test-cases/7fd5632b0213855d.json index a8b60e0827d..35d2412bde0 100644 --- a/allure-report/data/test-cases/60f5877935ced5c5.json +++ b/allure-report/data/test-cases/7fd5632b0213855d.json @@ -1 +1 @@ -{"uid":"60f5877935ced5c5","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724735127688,"stop":1724735127813,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127703,"duration":15},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127703,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127735,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127735,"stop":1724735127781,"duration":46},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127781,"stop":1724735127813,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5084a50ffeae5e8e","name":"stdout","source":"5084a50ffeae5e8e.txt","type":"text/plain","size":932}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724735127813,"stop":1724735127813,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Integers: Recreation One"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"OPTIMIZATION"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c16d54e01aa089ec","status":"passed","time":{"start":1724733472796,"stop":1724733472921,"duration":125}}],"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"60f5877935ced5c5.json","parameterValues":[]} \ No newline at end of file +{"uid":"7fd5632b0213855d","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724735127688,"stop":1724735127813,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127703,"duration":15},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127703,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127735,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127735,"stop":1724735127781,"duration":46},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127781,"stop":1724735127813,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4b46eca85ecd31e8","name":"stdout","source":"4b46eca85ecd31e8.txt","type":"text/plain","size":932}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724735127813,"stop":1724735127813,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Integers: Recreation One"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"OPTIMIZATION"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2512233f29820ca9","status":"passed","time":{"start":1724733472796,"stop":1724733472921,"duration":125}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"60f5877935ced5c5","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}}]},"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"7fd5632b0213855d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/92b17e5074e54ef7.json b/allure-report/data/test-cases/801bdccb4e1aa824.json similarity index 76% rename from allure-report/data/test-cases/92b17e5074e54ef7.json rename to allure-report/data/test-cases/801bdccb4e1aa824.json index 15514f93f74..8027dbc354b 100644 --- a/allure-report/data/test-cases/92b17e5074e54ef7.json +++ b/allure-report/data/test-cases/801bdccb4e1aa824.json @@ -1 +1 @@ -{"uid":"92b17e5074e54ef7","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"af2006fa8ad3035d","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"92b17e5074e54ef7.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"801bdccb4e1aa824","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"47a613697aa0c71f","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"92b17e5074e54ef7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"801bdccb4e1aa824.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/1f92252f389b32f9.json b/allure-report/data/test-cases/808471d4cfeae814.json
similarity index 67%
rename from allure-report/data/test-cases/1f92252f389b32f9.json
rename to allure-report/data/test-cases/808471d4cfeae814.json
index f8f21d5578b..8529819f92f 100644
--- a/allure-report/data/test-cases/1f92252f389b32f9.json
+++ b/allure-report/data/test-cases/808471d4cfeae814.json
@@ -1 +1 @@
-{"uid":"1f92252f389b32f9","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"36bee03d6cf0b073","name":"stdout","source":"36bee03d6cf0b073.txt","type":"text/plain","size":253}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"1f92252f389b32f9.json","parameterValues":[]} \ No newline at end of file +{"uid":"808471d4cfeae814","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"92552b4b1fe49529","name":"stdout","source":"92552b4b1fe49529.txt","type":"text/plain","size":253}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"808471d4cfeae814.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/80dd204b4961834.json b/allure-report/data/test-cases/80dd204b4961834.json new file mode 100644 index 00000000000..0bf410496d8 --- /dev/null +++ b/allure-report/data/test-cases/80dd204b4961834.json @@ -0,0 +1 @@ +{"uid":"80dd204b4961834","name":"a and b are equal","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_equal_numbers","historyId":"2972663ca9fa4b4f0e6ea69060a464d5","time":{"start":1724733474179,"stop":1724733474179,"duration":0},"description":"\n a and b are equal\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6ab893879ec80255","name":"stdout","source":"6ab893879ec80255.txt","type":"text/plain","size":1579}],"parameters":[],"stepsCount":7,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"23d2f8eb0089d9c","status":"passed","time":{"start":1724733472452,"stop":1724733472499,"duration":47}}],"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"521b14729542d5c4.json","parameterValues":[]} \ No newline at end of file +{"uid":"82619e3fb0e84d4d","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1724735127313,"stop":1724735127391,"duration":78},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"63766a355340dea4","name":"stdout","source":"63766a355340dea4.txt","type":"text/plain","size":1579}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"aacbcab78401e86c","status":"passed","time":{"start":1724733472452,"stop":1724733472499,"duration":47}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"521b14729542d5c4","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}}]},"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"82619e3fb0e84d4d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4359475f5ec554bd.json b/allure-report/data/test-cases/826a0963540c6e75.json similarity index 59% rename from allure-report/data/test-cases/4359475f5ec554bd.json rename to allure-report/data/test-cases/826a0963540c6e75.json index b02dffb8ae5..65dda47263b 100644 --- a/allure-report/data/test-cases/4359475f5ec554bd.json +++ b/allure-report/data/test-cases/826a0963540c6e75.json @@ -1 +1 @@ -{"uid":"4359475f5ec554bd","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Extend the list list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"985fda141a79d4a4","name":"stdout","source":"985fda141a79d4a4.txt","type":"text/plain","size":375}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c3671be37bb5a0b6","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"4359475f5ec554bd.json","parameterValues":[]} \ No newline at end of file +{"uid":"826a0963540c6e75","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Extend the list list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"15329bd7c41462e0","name":"stdout","source":"15329bd7c41462e0.txt","type":"text/plain","size":375}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a6a0450be3f30fe6","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"4359475f5ec554bd","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"826a0963540c6e75.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f39f65fd61fb96b1.json b/allure-report/data/test-cases/8271021679b0cc06.json similarity index 76% rename from allure-report/data/test-cases/f39f65fd61fb96b1.json rename to allure-report/data/test-cases/8271021679b0cc06.json index c66f56ee01d..1d9ec684202 100644 --- a/allure-report/data/test-cases/f39f65fd61fb96b1.json +++ b/allure-report/data/test-cases/8271021679b0cc06.json @@ -1 +1 @@ -{"uid":"f39f65fd61fb96b1","name":"Testing valid_parentheses function","fullName":"kyu_5.valid_parentheses.test_valid_parentheses.ValidParenthesesTestCase#test_valid_parentheses","historyId":"92164414ad94bf1f5638230345fa606d","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"description":"\n Test the function called that takes a string of parentheses,\n and determines if the order of the parentheses is valid.\n The function should return true if the string is valid,\n and false if it's invalid.\n\n Examples\n\n \"()\" => true\n \")(()))\" => false\n \"(\" => false\n \"(())((()())())\" => true\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b7aabddcd2b39bc4","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472921,"stop":1724733472921,"duration":0}}],"categories":[],"tags":["MATHEMATICS","NUMBERS","LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"62bf772c3a2aa5d2.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"84fd4c67efee5295","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724735127828,"stop":1724735127828,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"bc5cb7d257f882a1","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472921,"stop":1724733472921,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"62bf772c3a2aa5d2","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}}]},"tags":["MATHEMATICS","NUMBERS","LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"84fd4c67efee5295.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/b6d72f7fe7ecd8e2.json b/allure-report/data/test-cases/85cc51a7df0f4a6c.json
similarity index 72%
rename from allure-report/data/test-cases/b6d72f7fe7ecd8e2.json
rename to allure-report/data/test-cases/85cc51a7df0f4a6c.json
index 6ecfba69cea..fdf12b0ed09 100644
--- a/allure-report/data/test-cases/b6d72f7fe7ecd8e2.json
+++ b/allure-report/data/test-cases/85cc51a7df0f4a6c.json
@@ -1 +1 @@
-{"uid":"b6d72f7fe7ecd8e2","name":"Square numbers (positive)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_25","historyId":"e1a83b5e7221ab7611b800cba5c64efa","time":{"start":1724733474522,"stop":1724733474522,"duration":0},"description":"\n 25 is a square number\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6968a83bd2f66f6","name":"stdout","source":"6968a83bd2f66f6.txt","type":"text/plain","size":1536}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b0ff51cf7a3c2781","status":"passed","time":{"start":1724733474054,"stop":1724733474054,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"578c3a6cd3e7e40f","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}}]},"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"8655885cb5db7a58.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ce5b44ba32daaf31.json b/allure-report/data/test-cases/874b39a75ad8fa3b.json similarity index 58% rename from allure-report/data/test-cases/ce5b44ba32daaf31.json rename to allure-report/data/test-cases/874b39a75ad8fa3b.json index a622268b182..c9d40f33fc2 100644 --- a/allure-report/data/test-cases/ce5b44ba32daaf31.json +++ b/allure-report/data/test-cases/874b39a75ad8fa3b.json @@ -1 +1 @@ -{"uid":"ce5b44ba32daaf31","name":"Testing swap_values function","fullName":"kyu_8.swap_values.test_swap_values.SwapValuesTestCase#test_swap_values","historyId":"3546afa49f7d1872d60856dcd3614357","time":{"start":1724735129680,"stop":1724735129680,"duration":0},"description":"\n Testing swap_values function\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9130d2ce9d2203c6","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"620b2589fb870406.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"88c7e92ae3f035ea","name":"test_line_negative","fullName":"kyu_3.line_safari_is_that_a_line.test_line_negative.LineNegativeTestCase#test_line_negative","historyId":"e5c7abe0fcf3b79049d906f50808feb6","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Line Safari functionality\n Negative test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"22fcf1edf8ebf197","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"620b2589fb870406","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"88c7e92ae3f035ea.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/f3421cdd7cb94a40.json b/allure-report/data/test-cases/895ce9b19a080b91.json
similarity index 77%
rename from allure-report/data/test-cases/f3421cdd7cb94a40.json
rename to allure-report/data/test-cases/895ce9b19a080b91.json
index 9fa36047945..958c76b0e81 100644
--- a/allure-report/data/test-cases/f3421cdd7cb94a40.json
+++ b/allure-report/data/test-cases/895ce9b19a080b91.json
@@ -1 +1 @@
-{"uid":"f3421cdd7cb94a40","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6f22d94f06ac3a09","name":"stdout","source":"6f22d94f06ac3a09.txt","type":"text/plain","size":931}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MEMOIZATION"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"f3421cdd7cb94a40.json","parameterValues":[]} \ No newline at end of file +{"uid":"895ce9b19a080b91","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3d05ca7bd9d20192","name":"stdout","source":"3d05ca7bd9d20192.txt","type":"text/plain","size":931}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MEMOIZATION"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"895ce9b19a080b91.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c4e7b8420f6ec93b.json b/allure-report/data/test-cases/89c677f035513057.json similarity index 72% rename from allure-report/data/test-cases/c4e7b8420f6ec93b.json rename to allure-report/data/test-cases/89c677f035513057.json index 25779f7a11e..ed88e749794 100644 --- a/allure-report/data/test-cases/c4e7b8420f6ec93b.json +++ b/allure-report/data/test-cases/89c677f035513057.json @@ -1 +1 @@ -{"uid":"c4e7b8420f6ec93b","name":"Testing two_decimal_places function","fullName":"kyu_8.formatting_decimal_places_0.test_two_decimal_places.TwoDecimalPlacesTestCase#test_two_decimal_places","historyId":"e3ba8e7dce83ab9de36ddd0bc268f4f6","time":{"start":1724733474679,"stop":1724733474679,"duration":0},"description":"\n Testing two_decimal_places function\n with various test inputs.\n\n Each number should be formatted that it is\n rounded to two decimal places. You don't\n need to check whether the input is a valid\n number because only valid numbers are used\n in the tests.\n :return:\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"b2f6f360d1ace914","name":"stdout","source":"b2f6f360d1ace914.txt","type":"text/plain","size":878}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"bd89dc29359aa359","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"3fa15071b1bee987.json","parameterValues":[]} \ No newline at end of file +{"uid":"8a76fd0002a5824c","name":"Testing Encoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding.EncodingTestCase#test_encoding","historyId":"195b2d3cd638502ec301b9e9eaa3f969","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d7e0ef7caf28d559","name":"stdout","source":"d7e0ef7caf28d559.txt","type":"text/plain","size":878}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"761811e55728ed74","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"3fa15071b1bee987","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"8a76fd0002a5824c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/831a4a72cd312e40.json b/allure-report/data/test-cases/8af4ebd0495f0e70.json similarity index 72% rename from allure-report/data/test-cases/831a4a72cd312e40.json rename to allure-report/data/test-cases/8af4ebd0495f0e70.json index f2c55ff6c58..c157b35a931 100644 --- a/allure-report/data/test-cases/831a4a72cd312e40.json +++ b/allure-report/data/test-cases/8af4ebd0495f0e70.json @@ -1 +1 @@ -{"uid":"831a4a72cd312e40","name":"Testing string_to_array function","fullName":"kyu_8.convert_string_to_an_array.test_string_to_array.StringToArrayTestCase#test_string_to_array","historyId":"f51ecfb2c4460f518b2155a78436a09d","time":{"start":1724733474585,"stop":1724733474585,"duration":0},"description":"\n Testing string_to_array function.\n\n A function to split a string and\n convert it into an array of words.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d1cc8240eecf71ad","name":"stdout","source":"d1cc8240eecf71ad.txt","type":"text/plain","size":326}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"451dd55d479da390.json","parameterValues":[]} \ No newline at end of file +{"uid":"8f884e4fa29bb7d4","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1c7070c159aacf2e","name":"stdout","source":"1c7070c159aacf2e.txt","type":"text/plain","size":326}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"8f884e4fa29bb7d4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2993b93df714aac2.json b/allure-report/data/test-cases/9035abe5e1151932.json similarity index 53% rename from allure-report/data/test-cases/2993b93df714aac2.json rename to allure-report/data/test-cases/9035abe5e1151932.json index c5ad3153530..e909c1244f3 100644 --- a/allure-report/data/test-cases/2993b93df714aac2.json +++ b/allure-report/data/test-cases/9035abe5e1151932.json @@ -1 +1 @@ -{"uid":"2993b93df714aac2","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bd3f1d26bd9a423c","name":"stdout","source":"bd3f1d26bd9a423c.txt","type":"text/plain","size":434}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"2993b93df714aac2.json","parameterValues":[]} \ No newline at end of file +{"uid":"9035abe5e1151932","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6e51aca385250e4","name":"stdout","source":"6e51aca385250e4.txt","type":"text/plain","size":434}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"9035abe5e1151932.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f5b1db39220bbcf9.json b/allure-report/data/test-cases/9098856200f13690.json similarity index 54% rename from allure-report/data/test-cases/f5b1db39220bbcf9.json rename to allure-report/data/test-cases/9098856200f13690.json index 74cf133a00d..aaa3fcf66f8 100644 --- a/allure-report/data/test-cases/f5b1db39220bbcf9.json +++ b/allure-report/data/test-cases/9098856200f13690.json @@ -1 +1 @@ -{"uid":"f5b1db39220bbcf9","name":"Testing permute_a_palindrome (negative)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_negative","historyId":"7090b58c62fab362ad673c85c67765af","time":{"start":1724735128868,"stop":1724735128868,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"16493fa2e59b881f","name":"stdout","source":"16493fa2e59b881f.txt","type":"text/plain","size":242}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"7954a467ea4b79e1.json","parameterValues":[]} \ No newline at end of file +{"uid":"90a114379d845ff7","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6ce0e167f1507713","name":"stdout","source":"6ce0e167f1507713.txt","type":"text/plain","size":242}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"90a114379d845ff7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/90a24ba96aea3cfc.json b/allure-report/data/test-cases/90a24ba96aea3cfc.json new file mode 100644 index 00000000000..fcf14851caa --- /dev/null +++ b/allure-report/data/test-cases/90a24ba96aea3cfc.json @@ -0,0 +1 @@ +{"uid":"90a24ba96aea3cfc","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7efcea1d1ffd3662","name":"stdout","source":"7efcea1d1ffd3662.txt","type":"text/plain","size":544}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNCTIONS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Games"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"dcb40cbe5ee38417","status":"passed","time":{"start":1724733474023,"stop":1724733474023,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"396df158495e2556","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","NUMBERS","GAMES","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"90a24ba96aea3cfc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c0e2de6ef36ce602.json b/allure-report/data/test-cases/90eee3ddc83b1454.json similarity index 68% rename from allure-report/data/test-cases/c0e2de6ef36ce602.json rename to allure-report/data/test-cases/90eee3ddc83b1454.json index 3a10abb7d73..7eff5edf5ca 100644 --- a/allure-report/data/test-cases/c0e2de6ef36ce602.json +++ b/allure-report/data/test-cases/90eee3ddc83b1454.json @@ -1 +1 @@ -{"uid":"c0e2de6ef36ce602","name":"Testing two_decimal_places function","fullName":"kyu_8.formatting_decimal_places_0.test_two_decimal_places.TwoDecimalPlacesTestCase#test_two_decimal_places","historyId":"e3ba8e7dce83ab9de36ddd0bc268f4f6","time":{"start":1724735129477,"stop":1724735129477,"duration":0},"description":"\n Testing two_decimal_places function\n with various test inputs.\n\n Each number should be formatted that it is\n rounded to two decimal places. You don't\n need to check whether the input is a valid\n number because only valid numbers are used\n in the tests.\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2d914c949df5ab84","name":"stdout","source":"2d914c949df5ab84.txt","type":"text/plain","size":167}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"bbfb47c5ac3f243c.json","parameterValues":[]} \ No newline at end of file +{"uid":"91e2410535ccc997","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5763b31517fb1cf6","name":"stdout","source":"5763b31517fb1cf6.txt","type":"text/plain","size":167}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"91e2410535ccc997.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2b5b6c744b764be6.json b/allure-report/data/test-cases/91ed862dacbec840.json similarity index 93% rename from allure-report/data/test-cases/2b5b6c744b764be6.json rename to allure-report/data/test-cases/91ed862dacbec840.json index 88b27dc14ad..2793943af71 100644 --- a/allure-report/data/test-cases/2b5b6c744b764be6.json +++ b/allure-report/data/test-cases/91ed862dacbec840.json @@ -1 +1 @@ -{"uid":"2b5b6c744b764be6","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"2b5b6c744b764be6.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"91ed862dacbec840","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"91ed862dacbec840.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/3ea60f3a146e3d51.json b/allure-report/data/test-cases/92083f552ecb72c4.json
similarity index 62%
rename from allure-report/data/test-cases/3ea60f3a146e3d51.json
rename to allure-report/data/test-cases/92083f552ecb72c4.json
index 811ef7bfb13..57c9f9b4ff4 100644
--- a/allure-report/data/test-cases/3ea60f3a146e3d51.json
+++ b/allure-report/data/test-cases/92083f552ecb72c4.json
@@ -1 +1 @@
-{"uid":"3ea60f3a146e3d51","name":"Two smallest numbers in the start of the list","fullName":"kyu_7.sum_of_two_lowest_int.test_sum_two_smallest_numbers.SumTwoSmallestNumbersTestCase#test_sum_two_smallest_numbers","historyId":"429c2bf738c7d46e53c9a2e5226d6649","time":{"start":1724735129321,"stop":1724735129321,"duration":0},"description":"\n Test sum_two_smallest_numbers function\n The function should return the sum of\n the two lowest positive numbers\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"eba58defe547aa99","name":"stdout","source":"eba58defe547aa99.txt","type":"text/plain","size":565}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"922eccc2ca8ed714.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9393151991be7f33.json b/allure-report/data/test-cases/9393151991be7f33.json new file mode 100644 index 00000000000..96127017c18 --- /dev/null +++ b/allure-report/data/test-cases/9393151991be7f33.json @@ -0,0 +1 @@ +{"uid":"9393151991be7f33","name":"Testing 'sum_triangular_numbers' with negative numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_negative_numbers","historyId":"4e553d5e3ff5fc5c21a746a843af96e5","time":{"start":1724735129305,"stop":1724735129305,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with negative numbers\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Insert items to the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"20504931bd72ff66","name":"stdout","source":"20504931bd72ff66.txt","type":"text/plain","size":261}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"fc816863f78bcd65","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"93b3042e12ae0dc2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f8cfd8001c2b32fd.json b/allure-report/data/test-cases/95011c2c3c205658.json similarity index 61% rename from allure-report/data/test-cases/f8cfd8001c2b32fd.json rename to allure-report/data/test-cases/95011c2c3c205658.json index 646fa20b744..5f4a197887d 100644 --- a/allure-report/data/test-cases/f8cfd8001c2b32fd.json +++ b/allure-report/data/test-cases/95011c2c3c205658.json @@ -1 +1 @@ -{"uid":"f8cfd8001c2b32fd","name":"Square numbers (positive)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_25","historyId":"e1a83b5e7221ab7611b800cba5c64efa","time":{"start":1724735129352,"stop":1724735129352,"duration":0},"description":"\n 25 is a square number\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"92e60d573610c20c","name":"stdout","source":"92e60d573610c20c.txt","type":"text/plain","size":611}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"95172229a5a9ad6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/aee4538f6230f980.json b/allure-report/data/test-cases/9519f48ec729ba4c.json similarity index 64% rename from allure-report/data/test-cases/aee4538f6230f980.json rename to allure-report/data/test-cases/9519f48ec729ba4c.json index 95c98eeb5bc..18f38a5014a 100644 --- a/allure-report/data/test-cases/aee4538f6230f980.json +++ b/allure-report/data/test-cases/9519f48ec729ba4c.json @@ -1 +1 @@ -{"uid":"aee4538f6230f980","name":"Testing password function","fullName":"kyu_7.password_validator.test_password.PasswordTestCase#test_password","historyId":"aaef6593296fd19246b6caa71f38ecab","time":{"start":1724735129180,"stop":1724735129180,"duration":0},"description":"\n Testing password function with various test inputs\n :return:\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2fa0f7a126ad592b","name":"stdout","source":"2fa0f7a126ad592b.txt","type":"text/plain","size":1009}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Snail"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7b9876690035f17","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"16026a681cee6bae","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}}]},"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"95ddc175910ea52.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/95e612b16602c749.json b/allure-report/data/test-cases/95e612b16602c749.json new file mode 100644 index 00000000000..4f2c5b0f31a --- /dev/null +++ b/allure-report/data/test-cases/95e612b16602c749.json @@ -0,0 +1 @@ +{"uid":"95e612b16602c749","name":"Testing Calculator class","fullName":"kyu_3.calculator.test_calculator.CalculatorTestCase#test_calculator","historyId":"939a8064e3d28ec85fadd67010b560ae","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Calculator class\n A simple calculator that given a string of operators '()', '+', '-', '*', '/'\n and numbers separated by spaces will return the value of that expression\n\n :return: None\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4cfe45f98e3a162","name":"stdout","source":"4cfe45f98e3a162.txt","type":"text/plain","size":524}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Diagonal"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"431c7499a8a042ca","status":"passed","time":{"start":1724733473218,"stop":1724733473889,"duration":671}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7f2ec06c200d3086","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"964ad50f448ed64d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/83e3620464a462e0.json b/allure-report/data/test-cases/96bc84b88ae05ea5.json similarity index 92% rename from allure-report/data/test-cases/83e3620464a462e0.json rename to allure-report/data/test-cases/96bc84b88ae05ea5.json index 8d383453bc7..13c47eab118 100644 --- a/allure-report/data/test-cases/83e3620464a462e0.json +++ b/allure-report/data/test-cases/96bc84b88ae05ea5.json @@ -1 +1 @@ -{"uid":"83e3620464a462e0","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1724733472577,"stop":1724733472577,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 24, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"83e3620464a462e0.json","parameterValues":[]} \ No newline at end of file +{"uid":"96bc84b88ae05ea5","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1724733472577,"stop":1724733472577,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 24, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"96bc84b88ae05ea5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9710b9a44c2e3c82.json b/allure-report/data/test-cases/9710b9a44c2e3c82.json deleted file mode 100644 index 51497f6d6e1..00000000000 --- a/allure-report/data/test-cases/9710b9a44c2e3c82.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"9710b9a44c2e3c82","name":"Testing 'count_sheeps' function: positive flow","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep","historyId":"7c789f6ee990c99f027ff5b8c32573fd","time":{"start":1724735129414,"stop":1724735129414,"duration":0},"description":"\n Testing 'count_sheeps' function\n Consider an array of sheep where some sheep\n may be missing from their place.\n We need a function that counts the\n number of sheep present in the array\n (true means present).\n\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"65073b7edfec4e6b","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"2c2a3e42bb3933c8.json","parameterValues":[]} \ No newline at end of file +{"uid":"972d0622d29729c4","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1467bda4d9665eda","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"2c2a3e42bb3933c8","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"972d0622d29729c4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/98200e3d5ae32ca.json b/allure-report/data/test-cases/98200e3d5ae32ca.json new file mode 100644 index 00000000000..bed0a352d1d --- /dev/null +++ b/allure-report/data/test-cases/98200e3d5ae32ca.json @@ -0,0 +1 @@ +{"uid":"98200e3d5ae32ca","name":"Testing 'has_subpattern' (part 1) function","fullName":"kyu_6.string_subpattern_recognition_1.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"b91c13716f440f33b1f90d86b217b534","time":{"start":1724735128930,"stop":1724735128930,"duration":0},"description":"\n String subpattern recognition I\n\n Verify that 'has_subpattern' function to returns\n either true/True or false/False if a string can be\n seen as the repetition of a simpler/shorter subpattern or not.\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ff19f958435ebad0","name":"stdout","source":"ff19f958435ebad0.txt","type":"text/plain","size":676}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LOOPS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b93db50e25bdce85","status":"passed","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"df3147d31fee6968.json","parameterValues":[]} \ No newline at end of file +{"uid":"98d0f495e6dcba7e","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"62bd346b3a261fc6","name":"stdout","source":"62bd346b3a261fc6.txt","type":"text/plain","size":676}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LOOPS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"252f381a068f762f","status":"passed","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"df3147d31fee6968","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"98d0f495e6dcba7e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/990d1d89497fbcc.json b/allure-report/data/test-cases/990d1d89497fbcc.json deleted file mode 100644 index fef6bf476b9..00000000000 --- a/allure-report/data/test-cases/990d1d89497fbcc.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"990d1d89497fbcc","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"f220cca72eddc4b9","name":"stdout","source":"f220cca72eddc4b9.txt","type":"text/plain","size":717}],"parameters":[],"stepsCount":0,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"990d1d89497fbcc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/611b4f8cf836294a.json b/allure-report/data/test-cases/996165a0ada95681.json similarity index 68% rename from allure-report/data/test-cases/611b4f8cf836294a.json rename to allure-report/data/test-cases/996165a0ada95681.json index 6e5a4e3a9ec..49dd7945e72 100644 --- a/allure-report/data/test-cases/611b4f8cf836294a.json +++ b/allure-report/data/test-cases/996165a0ada95681.json @@ -1 +1 @@ -{"uid":"611b4f8cf836294a","name":"Testing two_decimal_places function","fullName":"kyu_7.formatting_decimal_places_1.test_two_decimal_places.TwoDecimalPlacesTestCase#test_two_decimal_places","historyId":"27ae718be00b2e9f316c37c338cb2894","time":{"start":1724735129117,"stop":1724735129117,"duration":0},"description":"\n Testing two_decimal_places function\n with various test inputs\n\n Each floating-point number should be\n formatted that only the first two\n decimal places are returned.\n\n You don't need to check whether the input\n is a valid number because only valid numbers\n are used in the tests.\n\n Don't round the numbers! Just cut them\n after two decimal places!\n\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an un-existing item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7aad212f16ce4ea2","name":"stdout","source":"7aad212f16ce4ea2.txt","type":"text/plain","size":378}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1585a2916e07d272","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"a33fb2570aec1823.json","parameterValues":[]} \ No newline at end of file +{"uid":"99a050e28b9f808c","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an un-existing item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d920f200ffe2c729","name":"stdout","source":"d920f200ffe2c729.txt","type":"text/plain","size":378}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ef7cb2e79441187e","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"a33fb2570aec1823","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"99a050e28b9f808c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d837297408a13c1e.json b/allure-report/data/test-cases/9a325845218dd6ae.json similarity index 59% rename from allure-report/data/test-cases/d837297408a13c1e.json rename to allure-report/data/test-cases/9a325845218dd6ae.json index 3b22f39bfcb..92a433757e4 100644 --- a/allure-report/data/test-cases/d837297408a13c1e.json +++ b/allure-report/data/test-cases/9a325845218dd6ae.json @@ -1 +1 @@ -{"uid":"d837297408a13c1e","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"88865904ee358dea","name":"stdout","source":"88865904ee358dea.txt","type":"text/plain","size":213}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"ARITHMETIC"},{"name":"story","value":"Sum of odd numbers"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8a609bc5e3d23df9","status":"passed","time":{"start":1724733474460,"stop":1724733474460,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","LISTS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"d837297408a13c1e.json","parameterValues":[]} \ No newline at end of file +{"uid":"9a325845218dd6ae","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a54c971159a9735d","name":"stdout","source":"a54c971159a9735d.txt","type":"text/plain","size":213}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"ARITHMETIC"},{"name":"story","value":"Sum of odd numbers"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a50af3a4d2a7afb5","status":"passed","time":{"start":1724733474460,"stop":1724733474460,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d837297408a13c1e","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","LISTS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"9a325845218dd6ae.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3e7b87e8229dd1a3.json b/allure-report/data/test-cases/9a93b35004a87c6a.json similarity index 94% rename from allure-report/data/test-cases/3e7b87e8229dd1a3.json rename to allure-report/data/test-cases/9a93b35004a87c6a.json index ad6d703c893..9a74bf00f7a 100644 --- a/allure-report/data/test-cases/3e7b87e8229dd1a3.json +++ b/allure-report/data/test-cases/9a93b35004a87c6a.json @@ -1 +1 @@ -{"uid":"3e7b87e8229dd1a3","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"3e7b87e8229dd1a3.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"9a93b35004a87c6a","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"9a93b35004a87c6a.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/402ddb0b000d2943.json b/allure-report/data/test-cases/9b0990a97652b0f6.json
similarity index 52%
rename from allure-report/data/test-cases/402ddb0b000d2943.json
rename to allure-report/data/test-cases/9b0990a97652b0f6.json
index 14e0acdc28d..ff6b0ac3b85 100644
--- a/allure-report/data/test-cases/402ddb0b000d2943.json
+++ b/allure-report/data/test-cases/9b0990a97652b0f6.json
@@ -1 +1 @@
-{"uid":"402ddb0b000d2943","name":"Testing set_alarm function","fullName":"kyu_8.set_alarm.test_set_alarm.SetAlarmTestCase#test_set_alarm","historyId":"77c7125894dc4635fdd1db51405959d3","time":{"start":1724733474897,"stop":1724733474897,"duration":0},"description":"\n Testing set_alarm function with various test inputs.\n\n The function should return true if you are employed\n and not on vacation (because these are the circumstances\n under which you need to set an alarm). It should return\n false otherwise.\n\n Examples:\n\n setAlarm(true, true) -> false\n setAlarm(false, true) -> false\n setAlarm(false, false) -> false\n setAlarm(true, false) -> true\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e94d8c1e516fca3a","name":"stdout","source":"e94d8c1e516fca3a.txt","type":"text/plain","size":1013}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Performance"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Row of the odd triangle"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"55242408764fe7c9","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"4c3877c30e625752.json","parameterValues":[]} \ No newline at end of file +{"uid":"9b82a842fdc9b867","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d27167744db90954","name":"stdout","source":"d27167744db90954.txt","type":"text/plain","size":1013}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Performance"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Row of the odd triangle"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e9a0c341753d9526","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"4c3877c30e625752","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}}]},"tags":["PERFORMANCE","ALGORITHMS"]},"source":"9b82a842fdc9b867.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6bb1a909958ad3a2.json b/allure-report/data/test-cases/9c38060cc376f686.json similarity index 61% rename from allure-report/data/test-cases/6bb1a909958ad3a2.json rename to allure-report/data/test-cases/9c38060cc376f686.json index f3a22c85426..ca0f8da7bf9 100644 --- a/allure-report/data/test-cases/6bb1a909958ad3a2.json +++ b/allure-report/data/test-cases/9c38060cc376f686.json @@ -1 +1 @@ -{"uid":"6bb1a909958ad3a2","name":"move function tests","fullName":"kyu_8.terminal_game_move_function.test_terminal_game_move_function.MoveTestCase#test_move","historyId":"c589035c90d432fb71a99aec4f56ee9e","time":{"start":1724735129680,"stop":1724735129680,"duration":0},"description":"\n The player rolls the dice and moves the number\n of spaces indicated by the dice two times.\n\n Pass position and roll and compare the output\n to the expected result\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7009434379983da3","name":"stdout","source":"7009434379983da3.txt","type":"text/plain","size":46002}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"fcb7b98557709e7f","status":"passed","time":{"start":1724733472624,"stop":1724733472765,"duration":141}}],"categories":[],"tags":["ALGORITHMS"]},"source":"2ed8dfd7ca5a3d13.json","parameterValues":[]} \ No newline at end of file +{"uid":"9cb8749ab5d5d5c7","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"79650f7b74d71675","name":"stdout","source":"79650f7b74d71675.txt","type":"text/plain","size":46002}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ce00ffd36d904f61","status":"passed","time":{"start":1724733472624,"stop":1724733472765,"duration":141}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"2ed8dfd7ca5a3d13","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}}]},"tags":["ALGORITHMS"]},"source":"9cb8749ab5d5d5c7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/39e365f7b1aa879c.json b/allure-report/data/test-cases/9cc84b4c3c851a20.json similarity index 71% rename from allure-report/data/test-cases/39e365f7b1aa879c.json rename to allure-report/data/test-cases/9cc84b4c3c851a20.json index 64189a8d3a7..cfbcacc584a 100644 --- a/allure-report/data/test-cases/39e365f7b1aa879c.json +++ b/allure-report/data/test-cases/9cc84b4c3c851a20.json @@ -1 +1 @@ -{"uid":"39e365f7b1aa879c","name":"Testing binary_to_string function","fullName":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string.SequenceTestCase#test_binary_to_string","historyId":"5e3d4a7b89a7ecee6b57c2383b63527b","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"66ad4b11c0086ef7","name":"stdout","source":"66ad4b11c0086ef7.txt","type":"text/plain","size":1380}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"suite","value":"Character Encodings"},{"name":"feature","value":"String"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"BINARY"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"39e365f7b1aa879c.json","parameterValues":[]} \ No newline at end of file +{"uid":"9cc84b4c3c851a20","name":"Testing binary_to_string function","fullName":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string.SequenceTestCase#test_binary_to_string","historyId":"5e3d4a7b89a7ecee6b57c2383b63527b","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f1386283fe3a63a2","name":"stdout","source":"f1386283fe3a63a2.txt","type":"text/plain","size":1380}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"suite","value":"Character Encodings"},{"name":"feature","value":"String"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"BINARY"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"9cc84b4c3c851a20.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9d396e0b9ed83131.json b/allure-report/data/test-cases/9d396e0b9ed83131.json deleted file mode 100644 index 1284e0d4a22..00000000000 --- a/allure-report/data/test-cases/9d396e0b9ed83131.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"9d396e0b9ed83131","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c5e4c41a6f3733c3","name":"stdout","source":"c5e4c41a6f3733c3.txt","type":"text/plain","size":3097}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"PARSING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"RANKING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"feature","value":"String"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"9d396e0b9ed83131.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/93145ed3e3e64e21.json b/allure-report/data/test-cases/9d8518015a2b07b6.json similarity index 78% rename from allure-report/data/test-cases/93145ed3e3e64e21.json rename to allure-report/data/test-cases/9d8518015a2b07b6.json index 2edd7e381fc..0613a536463 100644 --- a/allure-report/data/test-cases/93145ed3e3e64e21.json +++ b/allure-report/data/test-cases/9d8518015a2b07b6.json @@ -1 +1 @@ -{"uid":"93145ed3e3e64e21","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"777a522aaa0b36d6","name":"stdout","source":"777a522aaa0b36d6.txt","type":"text/plain","size":949}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"93145ed3e3e64e21.json","parameterValues":[]} \ No newline at end of file +{"uid":"9d8518015a2b07b6","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6570d6c473e55397","name":"stdout","source":"6570d6c473e55397.txt","type":"text/plain","size":949}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"9d8518015a2b07b6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c0ff31e127206139.json b/allure-report/data/test-cases/9e5b993187ac8b27.json similarity index 67% rename from allure-report/data/test-cases/c0ff31e127206139.json rename to allure-report/data/test-cases/9e5b993187ac8b27.json index 86f2a8c6739..34e0eb5c734 100644 --- a/allure-report/data/test-cases/c0ff31e127206139.json +++ b/allure-report/data/test-cases/9e5b993187ac8b27.json @@ -1 +1 @@ -{"uid":"c0ff31e127206139","name":"Testing 'has_subpattern' (part 2) function","fullName":"kyu_6.string_subpattern_recognition_2.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"3086879b276d25b4dd0f45ada5d9f20b","time":{"start":1724735128930,"stop":1724735128946,"duration":16},"description":"\n Verify that 'has_subpattern' function to returns\n either true/True or false/False if a string can be\n seen as the repetition of a simpler/shorter subpattern or not.\n\n 1. if a subpattern has been used, it will be repeated\n at least twice, meaning the subpattern has to be\n shorter than the original string;\n\n 2. the strings you will be given might or might not\n be created repeating a given subpattern, then\n shuffling the result.\n :return:\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ad5cb658d7b3a6f1","name":"stdout","source":"ad5cb658d7b3a6f1.txt","type":"text/plain","size":410}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Century From Year"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"e13311d47c82f25c.json","parameterValues":[]} \ No newline at end of file +{"uid":"9f6955234023cbe8","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5c0575d9cafe6cf6","name":"stdout","source":"5c0575d9cafe6cf6.txt","type":"text/plain","size":410}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Century From Year"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"9f6955234023cbe8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cd298347a8b67e93.json b/allure-report/data/test-cases/9f7fc4731241a976.json similarity index 63% rename from allure-report/data/test-cases/cd298347a8b67e93.json rename to allure-report/data/test-cases/9f7fc4731241a976.json index f811bbb3ad3..f5776d5607a 100644 --- a/allure-report/data/test-cases/cd298347a8b67e93.json +++ b/allure-report/data/test-cases/9f7fc4731241a976.json @@ -1 +1 @@ -{"uid":"cd298347a8b67e93","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4762790d78a26553","name":"stdout","source":"4762790d78a26553.txt","type":"text/plain","size":253}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1f92252f389b32f9","status":"passed","time":{"start":1724733474632,"stop":1724733474632,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS"]},"source":"cd298347a8b67e93.json","parameterValues":[]} \ No newline at end of file +{"uid":"9f7fc4731241a976","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3e00d2a8f3aaa1eb","name":"stdout","source":"3e00d2a8f3aaa1eb.txt","type":"text/plain","size":253}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"808471d4cfeae814","status":"passed","time":{"start":1724733474632,"stop":1724733474632,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"cd298347a8b67e93","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"9f7fc4731241a976.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e4e2296a825eac3f.json b/allure-report/data/test-cases/a08dd22616aac704.json similarity index 94% rename from allure-report/data/test-cases/e4e2296a825eac3f.json rename to allure-report/data/test-cases/a08dd22616aac704.json index c010c2aee24..19b3d468c21 100644 --- a/allure-report/data/test-cases/e4e2296a825eac3f.json +++ b/allure-report/data/test-cases/a08dd22616aac704.json @@ -1 +1 @@ -{"uid":"e4e2296a825eac3f","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Permutations"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"PERMUTATIONS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"e4e2296a825eac3f.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"a08dd22616aac704","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Permutations"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"PERMUTATIONS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a08dd22616aac704.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a10d36c92cf89a63.json b/allure-report/data/test-cases/a10d36c92cf89a63.json
new file mode 100644
index 00000000000..14812581480
--- /dev/null
+++ b/allure-report/data/test-cases/a10d36c92cf89a63.json
@@ -0,0 +1 @@
+{"uid":"a10d36c92cf89a63","name":"Testing 'count_sheeps' function: positive flow","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep","historyId":"7c789f6ee990c99f027ff5b8c32573fd","time":{"start":1724735129414,"stop":1724735129414,"duration":0},"description":"\n Testing 'count_sheeps' function\n Consider an array of sheep where some sheep\n may be missing from their place.\n We need a function that counts the\n number of sheep present in the array\n (true means present).\n\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8ec04fa99fe20225","name":"stdout","source":"8ec04fa99fe20225.txt","type":"text/plain","size":22}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"bf1274fce77ea3c3.json","parameterValues":[]} \ No newline at end of file +{"uid":"a381266642fdbdd2","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9185450f0b6d0b62","name":"stdout","source":"9185450f0b6d0b62.txt","type":"text/plain","size":22}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"a381266642fdbdd2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c11bd2bbb0f17cd9.json b/allure-report/data/test-cases/a492d74df14be54a.json similarity index 63% rename from allure-report/data/test-cases/c11bd2bbb0f17cd9.json rename to allure-report/data/test-cases/a492d74df14be54a.json index 683fbccff0b..eb86245ee10 100644 --- a/allure-report/data/test-cases/c11bd2bbb0f17cd9.json +++ b/allure-report/data/test-cases/a492d74df14be54a.json @@ -1 +1 @@ -{"uid":"c11bd2bbb0f17cd9","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"b953c5b7701746a6","name":"stdout","source":"b953c5b7701746a6.txt","type":"text/plain","size":242}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7954a467ea4b79e1","status":"passed","time":{"start":1724733474288,"stop":1724733474288,"duration":0}}],"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"c11bd2bbb0f17cd9.json","parameterValues":[]} \ No newline at end of file +{"uid":"a492d74df14be54a","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c144733a0318ce29","name":"stdout","source":"c144733a0318ce29.txt","type":"text/plain","size":242}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"90a114379d845ff7","status":"passed","time":{"start":1724733474288,"stop":1724733474288,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"c11bd2bbb0f17cd9","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"a492d74df14be54a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a4b7cb6ba7726224.json b/allure-report/data/test-cases/a4b7cb6ba7726224.json new file mode 100644 index 00000000000..4249097126e --- /dev/null +++ b/allure-report/data/test-cases/a4b7cb6ba7726224.json @@ -0,0 +1 @@ +{"uid":"a4b7cb6ba7726224","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1724733473171,"stop":1724733473186,"duration":15},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Remove items from the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3b4c7e69e73ca20","name":"stdout","source":"3b4c7e69e73ca20.txt","type":"text/plain","size":254}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"a4b7cb6ba7726224.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a4f7c6dc4c7e84.json b/allure-report/data/test-cases/a4f7c6dc4c7e84.json new file mode 100644 index 00000000000..a1e3ca8f032 --- /dev/null +++ b/allure-report/data/test-cases/a4f7c6dc4c7e84.json @@ -0,0 +1 @@ +{"uid":"a4f7c6dc4c7e84","name":"Testing 'vaporcode' function","fullName":"kyu_7.vaporcode.test_vaporcode.VaporcodeTestCase#test_vaporcode","historyId":"91791ed1a852f76f936407ccb3d2dbaa","time":{"start":1724733474507,"stop":1724733474507,"duration":0},"description":"\n Testing 'vaporcode' function\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"82b07dc960eb0dfb","name":"stdout","source":"82b07dc960eb0dfb.txt","type":"text/plain","size":213}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"story","value":"Sum of odd numbers"},{"name":"feature","value":"Math"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"8a609bc5e3d23df9.json","parameterValues":[]} \ No newline at end of file +{"uid":"a50af3a4d2a7afb5","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"26c574f777b434b5","name":"stdout","source":"26c574f777b434b5.txt","type":"text/plain","size":213}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"story","value":"Sum of odd numbers"},{"name":"feature","value":"Math"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"a50af3a4d2a7afb5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cb14dd2e679669bc.json b/allure-report/data/test-cases/a51a382d521d00cc.json similarity index 51% rename from allure-report/data/test-cases/cb14dd2e679669bc.json rename to allure-report/data/test-cases/a51a382d521d00cc.json index c84f4abbd10..895606037f2 100644 --- a/allure-report/data/test-cases/cb14dd2e679669bc.json +++ b/allure-report/data/test-cases/a51a382d521d00cc.json @@ -1 +1 @@ -{"uid":"cb14dd2e679669bc","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bddb4d20a85ffa0","name":"stdout","source":"bddb4d20a85ffa0.txt","type":"text/plain","size":562}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"cb14dd2e679669bc.json","parameterValues":[]} \ No newline at end of file +{"uid":"a51a382d521d00cc","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fb14be3959747375","name":"stdout","source":"fb14be3959747375.txt","type":"text/plain","size":562}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"a51a382d521d00cc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e66c4d32858afd04.json b/allure-report/data/test-cases/a54c934450b934d7.json similarity index 81% rename from allure-report/data/test-cases/e66c4d32858afd04.json rename to allure-report/data/test-cases/a54c934450b934d7.json index a7525e512ab..f387fe05940 100644 --- a/allure-report/data/test-cases/e66c4d32858afd04.json +++ b/allure-report/data/test-cases/a54c934450b934d7.json @@ -1 +1 @@ -{"uid":"e66c4d32858afd04","name":"Testing 'feast' function","fullName":"kyu_8.the_feast_of_many_beasts.test_feast.FeastTestCase#test_feast","historyId":"963bc543b4e4096b877e161985d8949c","time":{"start":1724733474929,"stop":1724733474929,"duration":0},"description":"\n Testing 'feast' function with various test inputs\n\n Testing a function feast that takes the animal's\n name and dish as arguments and returns true or\n false to indicate whether the beast is allowed\n to bring the dish to the feast.\n\n Assume that beast and dish are always lowercase strings,\n and that each has at least two letters. beast and dish\n may contain hyphens and spaces, but these will not appear\n at the beginning or end of the string. They will not\n contain numerals.\n\n There is just one rule: the dish must start and end with\n the same letters as the animal's name. For example, the\n great blue heron is bringing garlic naan and the chickadee\n is bringing chocolate cake.\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Extend the list list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"eea6ab4a75a4141f","name":"stdout","source":"eea6ab4a75a4141f.txt","type":"text/plain","size":375}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"c3671be37bb5a0b6.json","parameterValues":[]} \ No newline at end of file +{"uid":"a6a0450be3f30fe6","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Extend the list list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4e2e1868fac6f5c2","name":"stdout","source":"4e2e1868fac6f5c2.txt","type":"text/plain","size":375}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"a6a0450be3f30fe6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6827fd264cb4d263.json b/allure-report/data/test-cases/a6bf4a932c1ec147.json similarity index 72% rename from allure-report/data/test-cases/6827fd264cb4d263.json rename to allure-report/data/test-cases/a6bf4a932c1ec147.json index 852f9a96b5c..afd4f2b1550 100644 --- a/allure-report/data/test-cases/6827fd264cb4d263.json +++ b/allure-report/data/test-cases/a6bf4a932c1ec147.json @@ -1 +1 @@ -{"uid":"6827fd264cb4d263","name":"test_solution_big","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_big","historyId":"128bd70e221c2c2b932b5e8d4fdb22c0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 52, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d9a0350697dd0c07","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"6827fd264cb4d263.json","parameterValues":[]} \ No newline at end of file +{"uid":"a6bf4a932c1ec147","name":"test_solution_big","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_big","historyId":"128bd70e221c2c2b932b5e8d4fdb22c0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 52, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"311e6a6343f5272c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"6827fd264cb4d263","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a6bf4a932c1ec147.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9864dd17c374a4d8.json b/allure-report/data/test-cases/a70604cd2465a183.json similarity index 76% rename from allure-report/data/test-cases/9864dd17c374a4d8.json rename to allure-report/data/test-cases/a70604cd2465a183.json index 44d9d5ca435..6cf098246fd 100644 --- a/allure-report/data/test-cases/9864dd17c374a4d8.json +++ b/allure-report/data/test-cases/a70604cd2465a183.json @@ -1 +1 @@ -{"uid":"9864dd17c374a4d8","name":"Testing 'has_subpattern' (part 1) function","fullName":"kyu_6.string_subpattern_recognition_1.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"b91c13716f440f33b1f90d86b217b534","time":{"start":1724733474085,"stop":1724733474085,"duration":0},"description":"\n String subpattern recognition I\n\n Verify that 'has_subpattern' function to returns\n either true/True or false/False if a string can be\n seen as the repetition of a simpler/shorter subpattern or not.\n :return:\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6da8b20d7eb3affa","name":"stdout","source":"6da8b20d7eb3affa.txt","type":"text/plain","size":1904}],"parameters":[],"stepsCount":21,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"PARSING STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"9f56f65d85b3cd20.json","parameterValues":[]} \ No newline at end of file +{"uid":"a90fdb1fb3683308","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"18b79283e1874d20","name":"stdout","source":"18b79283e1874d20.txt","type":"text/plain","size":1904}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":21,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"PARSING STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"a90fdb1fb3683308.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8fbff2bb58c8a587.json b/allure-report/data/test-cases/a93bd997ced3859a.json similarity index 62% rename from allure-report/data/test-cases/8fbff2bb58c8a587.json rename to allure-report/data/test-cases/a93bd997ced3859a.json index a4b2d297b08..7503f9f09c4 100644 --- a/allure-report/data/test-cases/8fbff2bb58c8a587.json +++ b/allure-report/data/test-cases/a93bd997ced3859a.json @@ -1 +1 @@ -{"uid":"8fbff2bb58c8a587","name":"Testing 'numericals' function","fullName":"kyu_6.numericals_of_string.test_numericals.NumericalsTestCase#test_numericals","historyId":"d2b4dccd0eb8dfd6ef62ac0349f0f6a7","time":{"start":1724733473991,"stop":1724733474007,"duration":16},"description":"\n Testing 'numericals' function\n :return:\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"751c11b33d3f5691","name":"stdout","source":"751c11b33d3f5691.txt","type":"text/plain","size":601}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"12da189269ca1ca6.json","parameterValues":[]} \ No newline at end of file +{"uid":"a96041a690fcc058","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2143b544775b35fe","name":"stdout","source":"2143b544775b35fe.txt","type":"text/plain","size":601}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"a96041a690fcc058.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/502fa7fe3b72cd9a.json b/allure-report/data/test-cases/a97caba53074497b.json similarity index 54% rename from allure-report/data/test-cases/502fa7fe3b72cd9a.json rename to allure-report/data/test-cases/a97caba53074497b.json index 755431c0610..2a124dde051 100644 --- a/allure-report/data/test-cases/502fa7fe3b72cd9a.json +++ b/allure-report/data/test-cases/a97caba53074497b.json @@ -1 +1 @@ -{"uid":"502fa7fe3b72cd9a","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e0460595a654ff1f","name":"stdout","source":"e0460595a654ff1f.txt","type":"text/plain","size":2817}],"parameters":[],"stepsCount":30,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"502fa7fe3b72cd9a.json","parameterValues":[]} \ No newline at end of file +{"uid":"a97caba53074497b","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c60a729cdea9a7d9","name":"stdout","source":"c60a729cdea9a7d9.txt","type":"text/plain","size":2817}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":30,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"a97caba53074497b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a9f33e581ec48813.json b/allure-report/data/test-cases/a9f33e581ec48813.json new file mode 100644 index 00000000000..60dd76609fe --- /dev/null +++ b/allure-report/data/test-cases/a9f33e581ec48813.json @@ -0,0 +1 @@ +{"uid":"a9f33e581ec48813","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"1c3fe0844baefb8c","name":"stdout","source":"1c3fe0844baefb8c.txt","type":"text/plain","size":717}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":0,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"a9f33e581ec48813.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a9fa2bf5091c83a.json b/allure-report/data/test-cases/a9fa2bf5091c83a.json deleted file mode 100644 index ef4b4cd593e..00000000000 --- a/allure-report/data/test-cases/a9fa2bf5091c83a.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"a9fa2bf5091c83a","name":"Testing dirReduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e1e2028306699105","name":"stdout","source":"e1e2028306699105.txt","type":"text/plain","size":204}],"parameters":[],"stepsCount":2,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"a9fa2bf5091c83a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/aac9dbbaca38b054.json b/allure-report/data/test-cases/aac9dbbaca38b054.json deleted file mode 100644 index 7d4b75c037c..00000000000 --- a/allure-report/data/test-cases/aac9dbbaca38b054.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"aac9dbbaca38b054","name":"Testing 'sum_triangular_numbers' with big number as an input","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_big_number","historyId":"e2716f691be2a9d6b5fd30d66b1f784d","time":{"start":1724735129305,"stop":1724735129305,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with big number as an input\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2c0b65a9daada0df","name":"stdout","source":"2c0b65a9daada0df.txt","type":"text/plain","size":1579}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"aacbcab78401e86c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ab402f3759df06f.json b/allure-report/data/test-cases/ab402f3759df06f.json deleted file mode 100644 index 57cb01a1b46..00000000000 --- a/allure-report/data/test-cases/ab402f3759df06f.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"ab402f3759df06f","name":"Testing the 'unique_in_order' function","fullName":"kyu_6.unique_in_order.test_unique_in_order.UniqueInOrderTestCase#test_unique_in_order","historyId":"9cff2d5d4d73fbc92b1c7c29d738384f","time":{"start":1724735128977,"stop":1724735128977,"duration":0},"description":"\n Testing the 'unique_in_order' function\n with various test data\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cae9efbee6f5aead","name":"stdout","source":"cae9efbee6f5aead.txt","type":"text/plain","size":1127}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Help the bookseller !"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"9835bf28bd7241b2.json","parameterValues":[]} \ No newline at end of file +{"uid":"abba91be3722688b","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b8fb66a095ff9819","name":"stdout","source":"b8fb66a095ff9819.txt","type":"text/plain","size":1127}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Help the bookseller !"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"abba91be3722688b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/390f34682d25d573.json b/allure-report/data/test-cases/ac127c4c71bf788d.json similarity index 70% rename from allure-report/data/test-cases/390f34682d25d573.json rename to allure-report/data/test-cases/ac127c4c71bf788d.json index ce780b7040b..356fd8346dc 100644 --- a/allure-report/data/test-cases/390f34682d25d573.json +++ b/allure-report/data/test-cases/ac127c4c71bf788d.json @@ -1 +1 @@ -{"uid":"390f34682d25d573","name":"Find the int that appears an odd number of times","fullName":"kyu_6.find_the_odd_int.test_find_the_odd_int.FindTheOddIntTestCase#test_something","historyId":"0f9fe14df4043e3026ded68af344e3f2","time":{"start":1724733473913,"stop":1724733473913,"duration":0},"description":"\n Sample testing.\n Expected result is 5\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3113bb39449ddf28","name":"stdout","source":"3113bb39449ddf28.txt","type":"text/plain","size":908}],"parameters":[],"stepsCount":14,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"DECLARATIVE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PROGRAMMING"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ADVANCED"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ffa8274e0de065ab","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","PROGRAMMING","FUNDAMENTALS","FEATURES","ADVANCED"]},"source":"aca9d99cb0e5842e.json","parameterValues":[]} \ No newline at end of file +{"uid":"ace382695affabdf","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724735127438,"stop":1724735127453,"duration":15},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"ee2fa2d0000577e9","name":"stdout","source":"ee2fa2d0000577e9.txt","type":"text/plain","size":908}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":14,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"DECLARATIVE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PROGRAMMING"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ADVANCED"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2348115dae27ed81","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"aca9d99cb0e5842e","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}}]},"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","PROGRAMMING","FUNDAMENTALS","FEATURES","ADVANCED"]},"source":"ace382695affabdf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/781079de643a720d.json b/allure-report/data/test-cases/ae7d3fce45bf33fb.json similarity index 63% rename from allure-report/data/test-cases/781079de643a720d.json rename to allure-report/data/test-cases/ae7d3fce45bf33fb.json index 6968f7f8da7..8c287a51573 100644 --- a/allure-report/data/test-cases/781079de643a720d.json +++ b/allure-report/data/test-cases/ae7d3fce45bf33fb.json @@ -1 +1 @@ -{"uid":"781079de643a720d","name":"Testing make_upper_case function","fullName":"kyu_8.make_upper_case.test_make_upper_case.MakeUpperCaseTestCase#test_make_upper_case","historyId":"9fe496d12a67f53b3208a0b823f2d8c3","time":{"start":1724735129602,"stop":1724735129602,"duration":0},"description":"\n Sample Tests for make_upper_case function\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d071752d20b95de3","name":"stdout","source":"d071752d20b95de3.txt","type":"text/plain","size":204}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"aefb4681bbbff0c9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/224cd2efeafa2904.json b/allure-report/data/test-cases/af543ced061d8858.json similarity index 72% rename from allure-report/data/test-cases/224cd2efeafa2904.json rename to allure-report/data/test-cases/af543ced061d8858.json index 37e59649c9d..3098a2c7343 100644 --- a/allure-report/data/test-cases/224cd2efeafa2904.json +++ b/allure-report/data/test-cases/af543ced061d8858.json @@ -1 +1 @@ -{"uid":"224cd2efeafa2904","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_26","historyId":"49ea03f1d04a92057a336da49714852c","time":{"start":1724733474522,"stop":1724733474522,"duration":0},"description":"\n 26 is not a square number\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6caa4cb1d46acc21","name":"stdout","source":"6caa4cb1d46acc21.txt","type":"text/plain","size":117}],"parameters":[],"stepsCount":2,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"aad768e2b1065e77","status":"passed","time":{"start":1724733474975,"stop":1724733474975,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"627a7fd2fe38a284.json","parameterValues":[]} \ No newline at end of file +{"uid":"afae2f3faef55f2b","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"54973229fb9bb954","name":"stdout","source":"54973229fb9bb954.txt","type":"text/plain","size":117}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"133341d40af1e905","status":"passed","time":{"start":1724733474975,"stop":1724733474975,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"627a7fd2fe38a284","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"afae2f3faef55f2b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b14acb4de8eb0e3a.json b/allure-report/data/test-cases/afce902b58f1520a.json similarity index 68% rename from allure-report/data/test-cases/b14acb4de8eb0e3a.json rename to allure-report/data/test-cases/afce902b58f1520a.json index fcbdd51cfb0..219fc094f4a 100644 --- a/allure-report/data/test-cases/b14acb4de8eb0e3a.json +++ b/allure-report/data/test-cases/afce902b58f1520a.json @@ -1 +1 @@ -{"uid":"b14acb4de8eb0e3a","name":"Testing check_for_factor function: positive flow","fullName":"kyu_8.grasshopper_check_for_factor.test_check_for_factor.CheckForFactorTestCase#test_check_for_factor_true","historyId":"c8ef830d4279bee02e53bf3a04349c35","time":{"start":1724735129492,"stop":1724735129492,"duration":0},"description":"\n Testing check_for_factor function.\n\n This function should test if the\n factor is a factor of base.\n\n Return true if it is a factor.\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2563dd25f9db8ef8","name":"stdout","source":"2563dd25f9db8ef8.txt","type":"text/plain","size":565}],"parameters":[],"stepsCount":10,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"fca0a479e6a9caa","status":"passed","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"913459f449cde9ee.json","parameterValues":[]} \ No newline at end of file +{"uid":"b01fd4e8d095b60f","name":"Testing next_smaller function","fullName":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller.NextSmallerTestCase#test_next_smaller","historyId":"9d8cb8adf1764c55348d349698b938ac","time":{"start":1724735127235,"stop":1724735127250,"duration":15},"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5bb3529b62d1131a","name":"stdout","source":"5bb3529b62d1131a.txt","type":"text/plain","size":565}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"922eccc2ca8ed714","status":"passed","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"913459f449cde9ee","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}}]},"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"b01fd4e8d095b60f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3e075566662ada8b.json b/allure-report/data/test-cases/b0f9b8de2eb00fed.json similarity index 50% rename from allure-report/data/test-cases/3e075566662ada8b.json rename to allure-report/data/test-cases/b0f9b8de2eb00fed.json index 452e0809837..c06f343b0ff 100644 --- a/allure-report/data/test-cases/3e075566662ada8b.json +++ b/allure-report/data/test-cases/b0f9b8de2eb00fed.json @@ -1 +1 @@ -{"uid":"3e075566662ada8b","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"be12a7ae2303d05","name":"stdout","source":"be12a7ae2303d05.txt","type":"text/plain","size":230}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"feature","value":"Tuple"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"3e075566662ada8b.json","parameterValues":[]} \ No newline at end of file +{"uid":"b0f9b8de2eb00fed","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"67735b58dfb8e3b0","name":"stdout","source":"67735b58dfb8e3b0.txt","type":"text/plain","size":230}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"feature","value":"Tuple"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"b0f9b8de2eb00fed.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/27163d5f2266ba73.json b/allure-report/data/test-cases/b0ff51cf7a3c2781.json similarity index 68% rename from allure-report/data/test-cases/27163d5f2266ba73.json rename to allure-report/data/test-cases/b0ff51cf7a3c2781.json index 4fdc424230e..6f06abd3180 100644 --- a/allure-report/data/test-cases/27163d5f2266ba73.json +++ b/allure-report/data/test-cases/b0ff51cf7a3c2781.json @@ -1 +1 @@ -{"uid":"27163d5f2266ba73","name":"Testing the 'group_cities' function","fullName":"kyu_6.rotate_the_letters_of_each_element.test_group_cities.GroupCitiesTestCase#test_group_cities","historyId":"0b146f7fbac52b042804286da8716f6b","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"688ad3759760cab8","name":"stdout","source":"688ad3759760cab8.txt","type":"text/plain","size":1536}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Lists"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"LISTS"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"27163d5f2266ba73.json","parameterValues":[]} \ No newline at end of file +{"uid":"b0ff51cf7a3c2781","name":"Testing the 'group_cities' function","fullName":"kyu_6.rotate_the_letters_of_each_element.test_group_cities.GroupCitiesTestCase#test_group_cities","historyId":"0b146f7fbac52b042804286da8716f6b","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"108fa13d4dc4aeec","name":"stdout","source":"108fa13d4dc4aeec.txt","type":"text/plain","size":1536}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Lists"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"LISTS"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"b0ff51cf7a3c2781.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/204a2114486cc2f9.json b/allure-report/data/test-cases/b1c2f2381b1441f6.json similarity index 67% rename from allure-report/data/test-cases/204a2114486cc2f9.json rename to allure-report/data/test-cases/b1c2f2381b1441f6.json index ed2e595f2a9..2748e1f1beb 100644 --- a/allure-report/data/test-cases/204a2114486cc2f9.json +++ b/allure-report/data/test-cases/b1c2f2381b1441f6.json @@ -1 +1 @@ -{"uid":"204a2114486cc2f9","name":"Testing length function where head = None","fullName":"kyu_7.fun_with_lists_length.test_length.LengthTestCase#test_length_none","historyId":"2ab55d25b4f71b0a35e531ab6cae710e","time":{"start":1724735129117,"stop":1724735129117,"duration":0},"description":"\n Testing length function\n where head = None\n\n The method length, which accepts a linked list\n (head), and returns the length of the list.\n :return:\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"15675e98e5c4a9b8","name":"stdout","source":"15675e98e5c4a9b8.txt","type":"text/plain","size":1865}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"fa56d75fd8c33c3c","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"164087ecc666d9a0.json","parameterValues":[]} \ No newline at end of file +{"uid":"b1d54b76165521a0","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"616f142dc436d37a","name":"stdout","source":"616f142dc436d37a.txt","type":"text/plain","size":1865}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"1e3570598c901af4","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"164087ecc666d9a0","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"b1d54b76165521a0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d8f6e0603b79e82b.json b/allure-report/data/test-cases/b29b4bc1c1fe7917.json similarity index 70% rename from allure-report/data/test-cases/d8f6e0603b79e82b.json rename to allure-report/data/test-cases/b29b4bc1c1fe7917.json index b3436f9d44a..6056bfc17c4 100644 --- a/allure-report/data/test-cases/d8f6e0603b79e82b.json +++ b/allure-report/data/test-cases/b29b4bc1c1fe7917.json @@ -1 +1 @@ -{"uid":"d8f6e0603b79e82b","name":"Testing valid_parentheses function","fullName":"kyu_5.valid_parentheses.test_valid_parentheses.ValidParenthesesTestCase#test_valid_parentheses","historyId":"92164414ad94bf1f5638230345fa606d","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"description":"\n Test the function called that takes a string of parentheses,\n and determines if the order of the parentheses is valid.\n The function should return true if the string is valid,\n and false if it's invalid.\n\n Examples\n\n \"()\" => true\n \")(()))\" => false\n \"(\" => false\n \"(())((()())())\" => true\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Remove items from the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bf66b96af215b9a3","name":"stdout","source":"bf66b96af215b9a3.txt","type":"text/plain","size":254}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"b3ab40391b5da28d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/acc544bb5166af1c.json b/allure-report/data/test-cases/b48a50dffbb61197.json similarity index 70% rename from allure-report/data/test-cases/acc544bb5166af1c.json rename to allure-report/data/test-cases/b48a50dffbb61197.json index 5d5e6316cc1..a5cb35ee775 100644 --- a/allure-report/data/test-cases/acc544bb5166af1c.json +++ b/allure-report/data/test-cases/b48a50dffbb61197.json @@ -1 +1 @@ -{"uid":"acc544bb5166af1c","name":"Testing invite_more_women function (positive)","fullName":"kyu_7.simple_fun_152.test_invite_more_women.InviteMoreWomenTestCase#test_invite_more_women_positive","historyId":"d8680aad50eda2b69694580584e0455f","time":{"start":1724733474429,"stop":1724733474429,"duration":0},"description":"\n Simple Fun #152: Invite More Women?\n Testing invite_more_women function (positive)\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Append the list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"b965bcb2e6dc29da","name":"stdout","source":"b965bcb2e6dc29da.txt","type":"text/plain","size":261}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ffd2584e60c021f7","status":"passed","time":{"start":1724733473139,"stop":1724733473139,"duration":0}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"7f890ca68cdfc481.json","parameterValues":[]} \ No newline at end of file +{"uid":"b5a45493f51c1d67","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Append the list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"93547fa89048aa2f","name":"stdout","source":"93547fa89048aa2f.txt","type":"text/plain","size":261}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f90c5e53432ea6c2","status":"passed","time":{"start":1724733473139,"stop":1724733473139,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7f890ca68cdfc481","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"b5a45493f51c1d67.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cf4cdc94d1e2968c.json b/allure-report/data/test-cases/b5f6e3f148925a4f.json similarity index 71% rename from allure-report/data/test-cases/cf4cdc94d1e2968c.json rename to allure-report/data/test-cases/b5f6e3f148925a4f.json index 15d29715e98..8a12dca3190 100644 --- a/allure-report/data/test-cases/cf4cdc94d1e2968c.json +++ b/allure-report/data/test-cases/b5f6e3f148925a4f.json @@ -1 +1 @@ -{"uid":"cf4cdc94d1e2968c","name":"Testing domain_name function","fullName":"kyu_5.extract_the_domain_name_from_url.test_domain_name.DomainNameTestCase#test_domain_name","historyId":"cd64b52319d4c70d68e281e8561ab97f","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"658b23666826b836","name":"stdout","source":"658b23666826b836.txt","type":"text/plain","size":263}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"cf4cdc94d1e2968c.json","parameterValues":[]} \ No newline at end of file +{"uid":"b5f6e3f148925a4f","name":"Testing domain_name function","fullName":"kyu_5.extract_the_domain_name_from_url.test_domain_name.DomainNameTestCase#test_domain_name","historyId":"cd64b52319d4c70d68e281e8561ab97f","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e6af0cabbf264491","name":"stdout","source":"e6af0cabbf264491.txt","type":"text/plain","size":263}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"b5f6e3f148925a4f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b6301a55868859d.json b/allure-report/data/test-cases/b6301a55868859d.json new file mode 100644 index 00000000000..77388e947cd --- /dev/null +++ b/allure-report/data/test-cases/b6301a55868859d.json @@ -0,0 +1 @@ +{"uid":"b6301a55868859d","name":"Testing 'summation' function","fullName":"kyu_8.grasshopper_summation.test_summation.SummationTestCase#test_summation","historyId":"44ae966390833a332245c1886323c559","time":{"start":1724735129508,"stop":1724735129508,"duration":0},"description":"\n Testing summation function\n with various test inputs\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"b8231a3e84d54eef","name":"stdout","source":"b8231a3e84d54eef.txt","type":"text/plain","size":23}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"ce50dc4c6a1469d8","status":"passed","time":{"start":1724733475007,"stop":1724733475007,"duration":0}}],"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"73d92f8f0c07772d.json","parameterValues":[]} \ No newline at end of file +{"uid":"b97e3a9bf54f17f3","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"db0dfa2ecde82e2a","name":"stdout","source":"db0dfa2ecde82e2a.txt","type":"text/plain","size":23}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"e99ff83f7419b047","status":"passed","time":{"start":1724733475007,"stop":1724733475007,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"73d92f8f0c07772d","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"b97e3a9bf54f17f3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/79507cba518971f8.json b/allure-report/data/test-cases/b99ca9a8ecf19524.json similarity index 65% rename from allure-report/data/test-cases/79507cba518971f8.json rename to allure-report/data/test-cases/b99ca9a8ecf19524.json index ef864f89c1c..39c9f1afe0b 100644 --- a/allure-report/data/test-cases/79507cba518971f8.json +++ b/allure-report/data/test-cases/b99ca9a8ecf19524.json @@ -1 +1 @@ -{"uid":"79507cba518971f8","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e7956391f1917fb4","name":"stdout","source":"e7956391f1917fb4.txt","type":"text/plain","size":3898}],"parameters":[],"stepsCount":9,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAME BOARDS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"79507cba518971f8.json","parameterValues":[]} \ No newline at end of file +{"uid":"b99ca9a8ecf19524","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4e5a0ef8eae5b1f5","name":"stdout","source":"4e5a0ef8eae5b1f5.txt","type":"text/plain","size":3898}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAME BOARDS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"b99ca9a8ecf19524.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b9d7d0d5afb8734c.json b/allure-report/data/test-cases/b9d7d0d5afb8734c.json new file mode 100644 index 00000000000..597b01b3ef1 --- /dev/null +++ b/allure-report/data/test-cases/b9d7d0d5afb8734c.json @@ -0,0 +1 @@ +{"uid":"b9d7d0d5afb8734c","name":"Testing move_zeros function","fullName":"kyu_5.moving_zeros_to_the_end.test_move_zeros.MoveZerosTestCase#test_move_zeros","historyId":"4d406a702da9fd827c8c4798d255a6cf","time":{"start":1724735127844,"stop":1724735127844,"duration":0},"description":"\n Test an algorithm that takes an array and moves all of the\n zeros to the end, preserving the order of the other elements.\n :return:\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert training","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert battle","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c1b206842b9d15e3","name":"stdout","source":"c1b206842b9d15e3.txt","type":"text/plain","size":67}],"parameters":[],"stepsCount":12,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b8d68faa427e9f9d","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"bc3230f80ad8864d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b7aabddcd2b39bc4.json b/allure-report/data/test-cases/bc5cb7d257f882a1.json similarity index 94% rename from allure-report/data/test-cases/b7aabddcd2b39bc4.json rename to allure-report/data/test-cases/bc5cb7d257f882a1.json index 8770b5c6106..26d8ba99672 100644 --- a/allure-report/data/test-cases/b7aabddcd2b39bc4.json +++ b/allure-report/data/test-cases/bc5cb7d257f882a1.json @@ -1 +1 @@ -{"uid":"b7aabddcd2b39bc4","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Josephus Survivor"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"b7aabddcd2b39bc4.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"bc5cb7d257f882a1","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Josephus Survivor"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"bc5cb7d257f882a1.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/ab9ac5c7ad2aba25.json b/allure-report/data/test-cases/bd5d964c0a6197cf.json
similarity index 71%
rename from allure-report/data/test-cases/ab9ac5c7ad2aba25.json
rename to allure-report/data/test-cases/bd5d964c0a6197cf.json
index 851d8acef2b..9098ab4238c 100644
--- a/allure-report/data/test-cases/ab9ac5c7ad2aba25.json
+++ b/allure-report/data/test-cases/bd5d964c0a6197cf.json
@@ -1 +1 @@
-{"uid":"ab9ac5c7ad2aba25","name":"Testing 'summation' function","fullName":"kyu_8.grasshopper_summation.test_summation.SummationTestCase#test_summation","historyId":"44ae966390833a332245c1886323c559","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"description":"\n Testing summation function\n with various test inputs\n :return:\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2b46e4c3602d8a1","name":"stdout","source":"2b46e4c3602d8a1.txt","type":"text/plain","size":878}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"bd89dc29359aa359.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bdcb772653d8aad.json b/allure-report/data/test-cases/bdcb772653d8aad.json deleted file mode 100644 index 25a26c7ebe5..00000000000 --- a/allure-report/data/test-cases/bdcb772653d8aad.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"bdcb772653d8aad","name":"Testing move_zeros function","fullName":"kyu_5.moving_zeros_to_the_end.test_move_zeros.MoveZerosTestCase#test_move_zeros","historyId":"4d406a702da9fd827c8c4798d255a6cf","time":{"start":1724735127844,"stop":1724735127844,"duration":0},"description":"\n Test an algorithm that takes an array and moves all of the\n zeros to the end, preserving the order of the other elements.\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"afa5523631c32cdd","name":"stdout","source":"afa5523631c32cdd.txt","type":"text/plain","size":1093}],"parameters":[],"stepsCount":10,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Disease Spread"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2f476988eff12f93","status":"passed","time":{"start":1724733473186,"stop":1724733473186,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS"]},"source":"b3f7088fed8dedd7.json","parameterValues":[]} \ No newline at end of file +{"uid":"c1e0648976f6a694","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e11ad2661eb07ca9","name":"stdout","source":"e11ad2661eb07ca9.txt","type":"text/plain","size":1093}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Disease Spread"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d757011cc42c205e","status":"passed","time":{"start":1724733473186,"stop":1724733473186,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"b3f7088fed8dedd7","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"c1e0648976f6a694.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9592efbcf8c301ec.json b/allure-report/data/test-cases/c1ea0a3d5ef9530e.json similarity index 67% rename from allure-report/data/test-cases/9592efbcf8c301ec.json rename to allure-report/data/test-cases/c1ea0a3d5ef9530e.json index 906cc577d0f..318c16da660 100644 --- a/allure-report/data/test-cases/9592efbcf8c301ec.json +++ b/allure-report/data/test-cases/c1ea0a3d5ef9530e.json @@ -1 +1 @@ -{"uid":"9592efbcf8c301ec","name":"String with no duplicate chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_dup_none","historyId":"a2426de0b4808429aff451df95bbdc21","time":{"start":1724733473929,"stop":1724733473929,"duration":0},"description":"\n Test string with no duplicate chars\n :return:\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the smallest"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"eb2c31b2b7e0b335","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472765,"stop":1724733472765,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"257a5ad111bd69a7.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"c37dfc82a096ec09","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the smallest"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"20308d2341c6b899","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472765,"stop":1724733472765,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"257a5ad111bd69a7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}}]},"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c37dfc82a096ec09.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/c462a5b80d49c98b.json b/allure-report/data/test-cases/c462a5b80d49c98b.json
deleted file mode 100644
index c125f99b4e6..00000000000
--- a/allure-report/data/test-cases/c462a5b80d49c98b.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"c462a5b80d49c98b","name":"Testing 'count_sheeps' function: mixed list","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_mixed_list","historyId":"1b4dd61e36f8ec4ee2f83635d4e16e21","time":{"start":1724735129430,"stop":1724735129430,"duration":0},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like mixed list\n :return:\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"69eb503d0999422e","name":"stdout","source":"69eb503d0999422e.txt","type":"text/plain","size":3097}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"RANKING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FILTERING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9d396e0b9ed83131","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"647dfe698e2a6fdb.json","parameterValues":[]} \ No newline at end of file +{"uid":"c7c7f21adbc73706","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"62a27b454b36563d","name":"stdout","source":"62a27b454b36563d.txt","type":"text/plain","size":3097}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"RANKING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FILTERING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"68c4a39d8a6017b","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"647dfe698e2a6fdb","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"c7c7f21adbc73706.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c8a6a3e5884b319c.json b/allure-report/data/test-cases/c8a6a3e5884b319c.json deleted file mode 100644 index c7403f89459..00000000000 --- a/allure-report/data/test-cases/c8a6a3e5884b319c.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"c8a6a3e5884b319c","name":"Testing 'summation' function","fullName":"kyu_8.grasshopper_summation.test_summation.SummationTestCase#test_summation","historyId":"44ae966390833a332245c1886323c559","time":{"start":1724735129508,"stop":1724735129508,"duration":0},"description":"\n Testing summation function\n with various test inputs\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"ca423ea5ac901436.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/47c7c905d0e48c01.json b/allure-report/data/test-cases/cabe377ec9af3c98.json similarity index 68% rename from allure-report/data/test-cases/47c7c905d0e48c01.json rename to allure-report/data/test-cases/cabe377ec9af3c98.json index 522e7b6a3c2..73f28058cd9 100644 --- a/allure-report/data/test-cases/47c7c905d0e48c01.json +++ b/allure-report/data/test-cases/cabe377ec9af3c98.json @@ -1 +1 @@ -{"uid":"47c7c905d0e48c01","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7e868f0d93022512","name":"stdout","source":"7e868f0d93022512.txt","type":"text/plain","size":67}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"47c7c905d0e48c01.json","parameterValues":[]} \ No newline at end of file +{"uid":"cabe377ec9af3c98","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"292d200c224939da","name":"stdout","source":"292d200c224939da.txt","type":"text/plain","size":67}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"cabe377ec9af3c98.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cb5c8ea3b9796931.json b/allure-report/data/test-cases/cb5c8ea3b9796931.json new file mode 100644 index 00000000000..e1ebdc73929 --- /dev/null +++ b/allure-report/data/test-cases/cb5c8ea3b9796931.json @@ -0,0 +1 @@ +{"uid":"cb5c8ea3b9796931","name":"Testing make_readable function","fullName":"kyu_5.human_readable_time.test_make_readable.MakeReadableTestCase#test_make_readable","historyId":"ca529ab6c57db539179bf256595c3d50","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"description":"\n Testing make_readable function\n\n Write a function, which takes a non-negative integer\n (seconds) as input and returns the time in a human-readable\n format (HH:MM:SS)\n\n HH = hours, padded to 2 digits, range: 00 - 99\n MM = minutes, padded to 2 digits, range: 00 - 59\n SS = seconds, padded to 2 digits, range: 00 - 59\n\n The maximum time never exceeds 359999 (99:59:59)\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a8f23a9981f406ff","name":"stdout","source":"a8f23a9981f406ff.txt","type":"text/plain","size":371}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"cc5bed1d964110c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ccc9716a60da4021.json b/allure-report/data/test-cases/ccc9716a60da4021.json deleted file mode 100644 index 0f587a91c8c..00000000000 --- a/allure-report/data/test-cases/ccc9716a60da4021.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"ccc9716a60da4021","name":"Testing the 'unique_in_order' function","fullName":"kyu_6.unique_in_order.test_unique_in_order.UniqueInOrderTestCase#test_unique_in_order","historyId":"9cff2d5d4d73fbc92b1c7c29d738384f","time":{"start":1724733474116,"stop":1724733474116,"duration":0},"description":"\n Testing the 'unique_in_order' function\n with various test data\n :return:\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string aba and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string moOse and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a0b2ebd9f3514d62","name":"stdout","source":"a0b2ebd9f3514d62.txt","type":"text/plain","size":401}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"fe9e7cd98fc040fc","status":"passed","time":{"start":1724733474304,"stop":1724733474304,"duration":0}}],"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"3bd61bc704b417e2.json","parameterValues":[]} \ No newline at end of file +{"uid":"cd862d92408a60a2","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string aba and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string moOse and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5705204dae406a16","name":"stdout","source":"5705204dae406a16.txt","type":"text/plain","size":401}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1dfdd5c5551a6420","status":"passed","time":{"start":1724733474304,"stop":1724733474304,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"3bd61bc704b417e2","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"cd862d92408a60a2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/56ca3efbcb176750.json b/allure-report/data/test-cases/cdb95614a08f7813.json similarity index 65% rename from allure-report/data/test-cases/56ca3efbcb176750.json rename to allure-report/data/test-cases/cdb95614a08f7813.json index f166fbaaa21..766e70b8a1d 100644 --- a/allure-report/data/test-cases/56ca3efbcb176750.json +++ b/allure-report/data/test-cases/cdb95614a08f7813.json @@ -1 +1 @@ -{"uid":"56ca3efbcb176750","name":"String with mixed type of chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_dup_mixed","historyId":"befc81f16d3ea9a4d57ecd3fed78faff","time":{"start":1724733473929,"stop":1724733473929,"duration":0},"description":"\n Test string with mixed type of chars\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a1830f831e47cf3a","status":"passed","time":{"start":1724733474757,"stop":1724733474757,"duration":0}}],"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"f5a3f0d4d035c3a4.json","parameterValues":[]} \ No newline at end of file +{"uid":"cde5d1b46b10d7ac","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4783529dae6eb3af","status":"passed","time":{"start":1724733474757,"stop":1724733474757,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"f5a3f0d4d035c3a4","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}}]},"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"cde5d1b46b10d7ac.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7d1621a20d6f8fe7.json b/allure-report/data/test-cases/cdfe495bc85470d2.json similarity index 64% rename from allure-report/data/test-cases/7d1621a20d6f8fe7.json rename to allure-report/data/test-cases/cdfe495bc85470d2.json index 18cb64c21fd..ed12150a44f 100644 --- a/allure-report/data/test-cases/7d1621a20d6f8fe7.json +++ b/allure-report/data/test-cases/cdfe495bc85470d2.json @@ -1 +1 @@ -{"uid":"7d1621a20d6f8fe7","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Classes"},{"name":"story","value":"Potion Class 101"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"46081367fb92978f","status":"passed","time":{"start":1724733474038,"stop":1724733474038,"duration":0}}],"categories":[],"tags":["ALGORITHMS"]},"source":"7d1621a20d6f8fe7.json","parameterValues":[]} \ No newline at end of file +{"uid":"cdfe495bc85470d2","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Classes"},{"name":"story","value":"Potion Class 101"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5e4b4c0a3aeae99e","status":"passed","time":{"start":1724733474038,"stop":1724733474038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7d1621a20d6f8fe7","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"cdfe495bc85470d2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fcb7b98557709e7f.json b/allure-report/data/test-cases/ce00ffd36d904f61.json similarity index 75% rename from allure-report/data/test-cases/fcb7b98557709e7f.json rename to allure-report/data/test-cases/ce00ffd36d904f61.json index 8229a891706..e36bc6f65d5 100644 --- a/allure-report/data/test-cases/fcb7b98557709e7f.json +++ b/allure-report/data/test-cases/ce00ffd36d904f61.json @@ -1 +1 @@ -{"uid":"fcb7b98557709e7f","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1724733472624,"stop":1724733472765,"duration":141},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472624,"stop":1724733472749,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c9bdbc88a29a3828","name":"stdout","source":"c9bdbc88a29a3828.txt","type":"text/plain","size":46002}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"fcb7b98557709e7f.json","parameterValues":[]} \ No newline at end of file +{"uid":"ce00ffd36d904f61","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1724733472624,"stop":1724733472765,"duration":141},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472624,"stop":1724733472749,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"41f66f3f97e3d4e4","name":"stdout","source":"41f66f3f97e3d4e4.txt","type":"text/plain","size":46002}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"ce00ffd36d904f61.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f4c5ff18f0370583.json b/allure-report/data/test-cases/cf3552eb00513a1a.json similarity index 72% rename from allure-report/data/test-cases/f4c5ff18f0370583.json rename to allure-report/data/test-cases/cf3552eb00513a1a.json index 0effad44fb3..3fa123e6446 100644 --- a/allure-report/data/test-cases/f4c5ff18f0370583.json +++ b/allure-report/data/test-cases/cf3552eb00513a1a.json @@ -1 +1 @@ -{"uid":"f4c5ff18f0370583","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8316509a5b8b5aee","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"f4c5ff18f0370583.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"cf3552eb00513a1a","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f4ad45627654b5fc","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"f4c5ff18f0370583","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"cf3552eb00513a1a.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/53d75ff9d73daf75.json b/allure-report/data/test-cases/d0862b5213f7938f.json
similarity index 64%
rename from allure-report/data/test-cases/53d75ff9d73daf75.json
rename to allure-report/data/test-cases/d0862b5213f7938f.json
index 7632c27e823..5e4ea8d309a 100644
--- a/allure-report/data/test-cases/53d75ff9d73daf75.json
+++ b/allure-report/data/test-cases/d0862b5213f7938f.json
@@ -1 +1 @@
-{"uid":"53d75ff9d73daf75","name":"Negative non consecutive number should be returned","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_negative","historyId":"f9c1f10fe995fd827dbc67efd6c689cb","time":{"start":1724735129461,"stop":1724735129461,"duration":0},"description":"\n non-consecutive is a negative number.\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bf26048e33b52cf9","name":"stdout","source":"bf26048e33b52cf9.txt","type":"text/plain","size":640}],"parameters":[],"stepsCount":13,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ebad35c5d56f477f","status":"passed","time":{"start":1724733473093,"stop":1724733473093,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"d1585e7c78fd8d06.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d1a80d9f422182d.json b/allure-report/data/test-cases/d1a80d9f422182d.json new file mode 100644 index 00000000000..bd06f3e1a25 --- /dev/null +++ b/allure-report/data/test-cases/d1a80d9f422182d.json @@ -0,0 +1 @@ +{"uid":"d1a80d9f422182d","name":"goals function verification","fullName":"kyu_8.grasshopper_messi_goals_function.test_messi_goals_function.GoalsTestCase#test_goals","historyId":"7c1c8c6318c554c86b695deacecf1854","time":{"start":1724735129492,"stop":1724735129492,"duration":0},"description":"\n Verify that the function returns Messi's\n total number of goals in all three leagues.\n :return:\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"67250f10970b9ec2","name":"stdout","source":"67250f10970b9ec2.txt","type":"text/plain","size":410}],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e13311d47c82f25c","status":"passed","time":{"start":1724733474569,"stop":1724733474569,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"1d2c6842ef40288f.json","parameterValues":[]} \ No newline at end of file +{"uid":"d3037fd25424c6f3","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"763794db833f43e6","name":"stdout","source":"763794db833f43e6.txt","type":"text/plain","size":410}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9f6955234023cbe8","status":"passed","time":{"start":1724733474569,"stop":1724733474569,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"1d2c6842ef40288f","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"d3037fd25424c6f3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5ecd182a341dd7b4.json b/allure-report/data/test-cases/d4c41912963969d7.json similarity index 68% rename from allure-report/data/test-cases/5ecd182a341dd7b4.json rename to allure-report/data/test-cases/d4c41912963969d7.json index b58bf071cfa..82ac2cb1fbf 100644 --- a/allure-report/data/test-cases/5ecd182a341dd7b4.json +++ b/allure-report/data/test-cases/d4c41912963969d7.json @@ -1 +1 @@ -{"uid":"5ecd182a341dd7b4","name":"Testing all_fibonacci_numbers function","fullName":"kyu_5.fibonacci_streaming.test_all_fibonacci_numbers.AllFibonacciNumbersTestCase#test_all_fibonacci_numbers","historyId":"a7b5f0a3a7cd2fe8faed75e5c4a52138","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing all_fibonacci_numbers function\n\n You're going to provide a needy programmer a\n utility method that generates an infinite sized,\n sequential IntStream (in Python generator)\n which contains all the numbers in a fibonacci\n sequence.\n\n A fibonacci sequence starts with two 1s.\n Every element afterwards is the sum of\n the two previous elements.\n :return:\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":2,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"42d91b41703125e1","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"6ce4bba2ff4664c2.json","parameterValues":[]} \ No newline at end of file +{"uid":"d558fd9b3bcee4ae","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"3ceac2ca244e095b","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"6ce4bba2ff4664c2","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"d558fd9b3bcee4ae.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d57f06aa2f911f40.json b/allure-report/data/test-cases/d57f06aa2f911f40.json new file mode 100644 index 00000000000..ea683d8e625 --- /dev/null +++ b/allure-report/data/test-cases/d57f06aa2f911f40.json @@ -0,0 +1 @@ +{"uid":"d57f06aa2f911f40","name":"Testing 'longest_repetition' function","fullName":"kyu_6.longest_repetition.test_longest_repetition.LongestRepetitionTestCase#test_longest_repetition","historyId":"6431e0366c9c302e03ac01343fb7ea77","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"description":"\n For a given string s find the character c (or C) with\n longest consecutive repetition and return: (c, l)\n where l (or L) is the length of the repetition.\n\n For empty string return: ('', 0)\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"572cb30872911938","name":"stdout","source":"572cb30872911938.txt","type":"text/plain","size":1515}],"parameters":[],"stepsCount":13,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Human readable duration format"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"9f53adfade05c52d.json","parameterValues":[]} \ No newline at end of file +{"uid":"d5804044d1767680","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"10bda13bc4365ba8","name":"stdout","source":"10bda13bc4365ba8.txt","type":"text/plain","size":1515}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":13,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Human readable duration format"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"d5804044d1767680.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5329936079819472.json b/allure-report/data/test-cases/d5a389260d41a743.json similarity index 61% rename from allure-report/data/test-cases/5329936079819472.json rename to allure-report/data/test-cases/d5a389260d41a743.json index 6157a7df27d..9740d2276c3 100644 --- a/allure-report/data/test-cases/5329936079819472.json +++ b/allure-report/data/test-cases/d5a389260d41a743.json @@ -1 +1 @@ -{"uid":"5329936079819472","name":"Should return 'Publish!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_publish","historyId":"b4a1fa278aa899a374ebad09960e6cca","time":{"start":1724735129711,"stop":1724735129711,"duration":0},"description":"\n If there are one or two good ideas,\n return 'Publish!',\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"51e59668932e1548.json","parameterValues":[]} \ No newline at end of file +{"uid":"d5eb9c17e95fe424","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_2","historyId":"72a2d75b45f09e520765f369cfc2bc8f","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"d5eb9c17e95fe424.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/838103f8c8d195b2.json b/allure-report/data/test-cases/d62d5681db1186b9.json similarity index 80% rename from allure-report/data/test-cases/838103f8c8d195b2.json rename to allure-report/data/test-cases/d62d5681db1186b9.json index dad0938e320..2db8fcfc961 100644 --- a/allure-report/data/test-cases/838103f8c8d195b2.json +++ b/allure-report/data/test-cases/d62d5681db1186b9.json @@ -1 +1 @@ -{"uid":"838103f8c8d195b2","name":"Testing 'has_subpattern' (part 3) function","fullName":"kyu_6.string_subpattern_recognition_3.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"89f53112353ba49dc8f3a4029d39ba34","time":{"start":1724733474101,"stop":1724733474101,"duration":0},"description":"\n Verify that 'has_subpattern' function\n\n Return a subpattern with sorted characters,\n otherwise return the base string with sorted\n characters (you might consider this case as\n an edge case, with the subpattern being repeated\n only once and thus equalling the original input string).\n :return:\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9d4907fb8e8c491a","name":"stdout","source":"9d4907fb8e8c491a.txt","type":"text/plain","size":1904}],"parameters":[],"stepsCount":21,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"2 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9f56f65d85b3cd20","status":"passed","time":{"start":1724733472280,"stop":1724733472280,"duration":0}}],"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"d6d06cbc227917e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ad08cb0fb6eef203.json b/allure-report/data/test-cases/d6d51bdb700f78e3.json similarity index 72% rename from allure-report/data/test-cases/ad08cb0fb6eef203.json rename to allure-report/data/test-cases/d6d51bdb700f78e3.json index f51866315b3..026fac78f1c 100644 --- a/allure-report/data/test-cases/ad08cb0fb6eef203.json +++ b/allure-report/data/test-cases/d6d51bdb700f78e3.json @@ -1 +1 @@ -{"uid":"ad08cb0fb6eef203","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 24, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"83e3620464a462e0","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ad08cb0fb6eef203.json","parameterValues":[]} \ No newline at end of file +{"uid":"d6d51bdb700f78e3","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 24, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"96bc84b88ae05ea5","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"ad08cb0fb6eef203","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"d6d51bdb700f78e3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/af3c309699fc2b8b.json b/allure-report/data/test-cases/d6e4ebd44034ff08.json similarity index 74% rename from allure-report/data/test-cases/af3c309699fc2b8b.json rename to allure-report/data/test-cases/d6e4ebd44034ff08.json index 9fbc7dd00fc..b5033ddbc43 100644 --- a/allure-report/data/test-cases/af3c309699fc2b8b.json +++ b/allure-report/data/test-cases/d6e4ebd44034ff08.json @@ -1 +1 @@ -{"uid":"af3c309699fc2b8b","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f242bfa987012064","name":"stdout","source":"f242bfa987012064.txt","type":"text/plain","size":949}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"93145ed3e3e64e21","status":"passed","time":{"start":1724733472437,"stop":1724733472437,"duration":0}}],"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"af3c309699fc2b8b.json","parameterValues":[]} \ No newline at end of file +{"uid":"d6e4ebd44034ff08","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"ea7fb2d8338c4ae8","name":"stdout","source":"ea7fb2d8338c4ae8.txt","type":"text/plain","size":949}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9d8518015a2b07b6","status":"passed","time":{"start":1724733472437,"stop":1724733472437,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"af3c309699fc2b8b","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}}]},"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"d6e4ebd44034ff08.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6881087bd4c8b374.json b/allure-report/data/test-cases/d6e6e46de805754f.json similarity index 61% rename from allure-report/data/test-cases/6881087bd4c8b374.json rename to allure-report/data/test-cases/d6e6e46de805754f.json index 43d615f2ffe..4f284f9e81e 100644 --- a/allure-report/data/test-cases/6881087bd4c8b374.json +++ b/allure-report/data/test-cases/d6e6e46de805754f.json @@ -1 +1 @@ -{"uid":"6881087bd4c8b374","name":"Non consecutive number should be returned","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_positive","historyId":"13df60cbdff5ee076adcd6328cc69159","time":{"start":1724735129461,"stop":1724735129461,"duration":0},"description":"\n If we have an array [1,2,3,4,6,7,8] then 1 then 2\n then 3 then 4 are all consecutive but 6 is not,\n so that's the first non-consecutive number.\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"402ca4d0fca525c3","name":"stdout","source":"402ca4d0fca525c3.txt","type":"text/plain","size":348}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Who likes it?"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6af4bd9ac0e81498","status":"passed","time":{"start":1724733474132,"stop":1724733474132,"duration":0}}],"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"57946e73be805e2a.json","parameterValues":[]} \ No newline at end of file +{"uid":"d7357eaa8c15ec47","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3a93f15f0e448e53","name":"stdout","source":"3a93f15f0e448e53.txt","type":"text/plain","size":348}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Who likes it?"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ddf52bfae3cd34f4","status":"passed","time":{"start":1724733474132,"stop":1724733474132,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"57946e73be805e2a","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"d7357eaa8c15ec47.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2f476988eff12f93.json b/allure-report/data/test-cases/d757011cc42c205e.json similarity index 50% rename from allure-report/data/test-cases/2f476988eff12f93.json rename to allure-report/data/test-cases/d757011cc42c205e.json index 6dacf1e8821..44e04e6b1cd 100644 --- a/allure-report/data/test-cases/2f476988eff12f93.json +++ b/allure-report/data/test-cases/d757011cc42c205e.json @@ -1 +1 @@ -{"uid":"2f476988eff12f93","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1ae03ec55e1d110","name":"stdout","source":"1ae03ec55e1d110.txt","type":"text/plain","size":1093}],"parameters":[],"stepsCount":10,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Disease Spread"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"2f476988eff12f93.json","parameterValues":[]} \ No newline at end of file +{"uid":"d757011cc42c205e","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c954d80fa61d867d","name":"stdout","source":"c954d80fa61d867d.txt","type":"text/plain","size":1093}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Disease Spread"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"d757011cc42c205e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a80b9adf611eb67d.json b/allure-report/data/test-cases/d7c1fb6f236110ca.json similarity index 64% rename from allure-report/data/test-cases/a80b9adf611eb67d.json rename to allure-report/data/test-cases/d7c1fb6f236110ca.json index d311aa51993..74e4000e4bc 100644 --- a/allure-report/data/test-cases/a80b9adf611eb67d.json +++ b/allure-report/data/test-cases/d7c1fb6f236110ca.json @@ -1 +1 @@ -{"uid":"a80b9adf611eb67d","name":"Testing number_of_sigfigs function","fullName":"kyu_7.significant_figures.test_number_of_sigfigs.NumberOfSigFigsTestCase#test_number_of_sigfigs","historyId":"3b2ebb1924dbc4e6a73dc5dda19dd323","time":{"start":1724735129242,"stop":1724735129242,"duration":0},"description":"\n Testing number_of_sigfigs function\n with various test inputs\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"a541c471a2ff7ad0","name":"stdout","source":"a541c471a2ff7ad0.txt","type":"text/plain","size":717}],"parameters":[],"stepsCount":0,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"990d1d89497fbcc","status":"passed","time":{"start":1724733473944,"stop":1724733473944,"duration":0}}],"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"863d982a547ab48a.json","parameterValues":[]} \ No newline at end of file +{"uid":"d9458c8615b9e985","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"7941ce7b9fdf9a23","name":"stdout","source":"7941ce7b9fdf9a23.txt","type":"text/plain","size":717}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":0,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a9f33e581ec48813","status":"passed","time":{"start":1724733473944,"stop":1724733473944,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"863d982a547ab48a","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"d9458c8615b9e985.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e885db3276511b9a.json b/allure-report/data/test-cases/d946600dafcc1f6d.json similarity index 60% rename from allure-report/data/test-cases/e885db3276511b9a.json rename to allure-report/data/test-cases/d946600dafcc1f6d.json index 232592d23b1..cf5e28a68dc 100644 --- a/allure-report/data/test-cases/e885db3276511b9a.json +++ b/allure-report/data/test-cases/d946600dafcc1f6d.json @@ -1 +1 @@ -{"uid":"e885db3276511b9a","name":"String with mixed type of chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_dup_mixed","historyId":"befc81f16d3ea9a4d57ecd3fed78faff","time":{"start":1724735128789,"stop":1724735128789,"duration":0},"description":"\n Test string with mixed type of chars\n :return:\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"70c3d96b077c7c36","name":"stdout","source":"70c3d96b077c7c36.txt","type":"text/plain","size":530}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"828252a14a7968ec","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"7e0e76f32ac7ce4e.json","parameterValues":[]} \ No newline at end of file +{"uid":"d9a6d590487a20fd","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"25c7546e6e88bf29","name":"stdout","source":"25c7546e6e88bf29.txt","type":"text/plain","size":530}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"58ec93395b112a8f","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7e0e76f32ac7ce4e","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"d9a6d590487a20fd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b867e5092f796e5b.json b/allure-report/data/test-cases/da49bdf1737798b8.json similarity index 71% rename from allure-report/data/test-cases/b867e5092f796e5b.json rename to allure-report/data/test-cases/da49bdf1737798b8.json index 9d23664cd11..7307a2a05b4 100644 --- a/allure-report/data/test-cases/b867e5092f796e5b.json +++ b/allure-report/data/test-cases/da49bdf1737798b8.json @@ -1 +1 @@ -{"uid":"b867e5092f796e5b","name":"Testing check_exam function","fullName":"kyu_8.check_the_exam.test_check_exam.CheckExamTestCase#test_check_exam","historyId":"ed6c1e5f0eb38874fc66b7fa53f68e12","time":{"start":1724735129399,"stop":1724735129399,"duration":0},"description":"\n Testing check_exam function\n\n The function should return the score\n for this array of answers, giving +4\n for each correct answer, -1 for each\n incorrect answer, and +0 for each blank\n answer(empty string).\n\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e563acaa0f865561","name":"stdout","source":"e563acaa0f865561.txt","type":"text/plain","size":304}],"parameters":[],"stepsCount":8,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"1c1ac4b8936ce5ba.json","parameterValues":[]} \ No newline at end of file +{"uid":"db267da7b8a1b004","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8418aaca0f21809c","name":"stdout","source":"8418aaca0f21809c.txt","type":"text/plain","size":304}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"db267da7b8a1b004.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5e662d87bdd84a50.json b/allure-report/data/test-cases/dbd8c0e7d9b1bcd0.json similarity index 74% rename from allure-report/data/test-cases/5e662d87bdd84a50.json rename to allure-report/data/test-cases/dbd8c0e7d9b1bcd0.json index 2e58891669f..5371b9bf405 100644 --- a/allure-report/data/test-cases/5e662d87bdd84a50.json +++ b/allure-report/data/test-cases/dbd8c0e7d9b1bcd0.json @@ -1 +1 @@ -{"uid":"5e662d87bdd84a50","name":"Testing compute_ranks","fullName":"kyu_5.sports_league_table_ranking.test_compute_ranks.ComputeRanksTestCase#test_something","historyId":"21739eee721a124a84e5414945df03e6","time":{"start":1724733472983,"stop":1724733472983,"duration":0},"description":"\n Test the function that organizes a sports league in a\n round-robin-system. Each team meets all other teams.\n In your league a win gives a team 2 points, a draw gives\n both teams 1 point. After some games you have to compute\n the order of the teams in your league. You use the following\n criteria to arrange the teams:\n\n - Points\n - Scoring differential (the difference between goals scored and those conceded)\n - Goals scored\n\n :return:\n ","descriptionHtml":"Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"53524752e4f404ea","name":"stdout","source":"53524752e4f404ea.txt","type":"text/plain","size":502}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"960c8899017a5d3c","status":"passed","time":{"start":1724733473061,"stop":1724733473061,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"f52a489cb0add672.json","parameterValues":[]} \ No newline at end of file +{"uid":"dc29e000a4adcd25","name":"Testing array_diff function","fullName":"kyu_6.array_diff.test_array_diff.ArrayDiffTestCase#test_array_diff_function","historyId":"5e365f66b39a2fede4fe18a5cc569699","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c9a3c6ad41839ce3","name":"stdout","source":"c9a3c6ad41839ce3.txt","type":"text/plain","size":502}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6fce95111dc1cc14","status":"passed","time":{"start":1724733473061,"stop":1724733473061,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"f52a489cb0add672","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"dc29e000a4adcd25.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/abf7d26758417bf9.json b/allure-report/data/test-cases/dcb40cbe5ee38417.json similarity index 67% rename from allure-report/data/test-cases/abf7d26758417bf9.json rename to allure-report/data/test-cases/dcb40cbe5ee38417.json index aee5f785f40..57eb7eedc12 100644 --- a/allure-report/data/test-cases/abf7d26758417bf9.json +++ b/allure-report/data/test-cases/dcb40cbe5ee38417.json @@ -1 +1 @@ -{"uid":"abf7d26758417bf9","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"86ab33dc86ae86c3","name":"stdout","source":"86ab33dc86ae86c3.txt","type":"text/plain","size":544}],"parameters":[],"stepsCount":7,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"suite","value":"Games"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"CONTROL FLOW"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"abf7d26758417bf9.json","parameterValues":[]} \ No newline at end of file +{"uid":"dcb40cbe5ee38417","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b63774e9e6663cf7","name":"stdout","source":"b63774e9e6663cf7.txt","type":"text/plain","size":544}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"suite","value":"Games"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"CONTROL FLOW"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"dcb40cbe5ee38417.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a37b17c93d1df521.json b/allure-report/data/test-cases/dcfefe9c10c1f5d2.json similarity index 61% rename from allure-report/data/test-cases/a37b17c93d1df521.json rename to allure-report/data/test-cases/dcfefe9c10c1f5d2.json index c90dd61d4e6..92618deae91 100644 --- a/allure-report/data/test-cases/a37b17c93d1df521.json +++ b/allure-report/data/test-cases/dcfefe9c10c1f5d2.json @@ -1 +1 @@ -{"uid":"a37b17c93d1df521","name":"a or b is negative","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_negative_numbers","historyId":"2889ca714f21625b11b311b780ead719","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"description":"\n a or b is negative\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d20f4b2271cbc6fa","name":"stdout","source":"d20f4b2271cbc6fa.txt","type":"text/plain","size":348}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Who likes it?"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"6af4bd9ac0e81498.json","parameterValues":[]} \ No newline at end of file +{"uid":"ddf52bfae3cd34f4","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"60ce0e41b02093a3","name":"stdout","source":"60ce0e41b02093a3.txt","type":"text/plain","size":348}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Who likes it?"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"ddf52bfae3cd34f4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3d3e842542b066f3.json b/allure-report/data/test-cases/de04793abb90de01.json similarity index 69% rename from allure-report/data/test-cases/3d3e842542b066f3.json rename to allure-report/data/test-cases/de04793abb90de01.json index 804f69c4280..bda0caf6277 100644 --- a/allure-report/data/test-cases/3d3e842542b066f3.json +++ b/allure-report/data/test-cases/de04793abb90de01.json @@ -1 +1 @@ -{"uid":"3d3e842542b066f3","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9fc84a1435124a1a","name":"stdout","source":"9fc84a1435124a1a.txt","type":"text/plain","size":428}],"parameters":[],"stepsCount":9,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Factorial"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Color Choice"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cf2907457d950935","status":"passed","time":{"start":1724733473124,"stop":1724733473124,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS"]},"source":"3d3e842542b066f3.json","parameterValues":[]} \ No newline at end of file +{"uid":"de04793abb90de01","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f1276b53d50f9117","name":"stdout","source":"f1276b53d50f9117.txt","type":"text/plain","size":428}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Factorial"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Color Choice"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4979ee3063a87441","status":"passed","time":{"start":1724733473124,"stop":1724733473124,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"3d3e842542b066f3","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"de04793abb90de01.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/91ff78dc5a767b91.json b/allure-report/data/test-cases/dead64fe3d4f484d.json similarity index 56% rename from allure-report/data/test-cases/91ff78dc5a767b91.json rename to allure-report/data/test-cases/dead64fe3d4f484d.json index 8ef1cf96d22..46c98d0f9f6 100644 --- a/allure-report/data/test-cases/91ff78dc5a767b91.json +++ b/allure-report/data/test-cases/dead64fe3d4f484d.json @@ -1 +1 @@ -{"uid":"91ff78dc5a767b91","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have Dog arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 5 arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have good arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 50lb arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have brown arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1193ec856aedeb02","name":"stdout","source":"1193ec856aedeb02.txt","type":"text/plain","size":148}],"parameters":[],"stepsCount":7,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ea06cb7ae28c8945","status":"passed","time":{"start":1724733474319,"stop":1724733474319,"duration":0}}],"categories":[],"tags":[]},"source":"91ff78dc5a767b91.json","parameterValues":[]} \ No newline at end of file +{"uid":"dead64fe3d4f484d","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have Dog arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 5 arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have good arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 50lb arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have brown arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6b3bb7e070cc7a5c","name":"stdout","source":"6b3bb7e070cc7a5c.txt","type":"text/plain","size":148}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e21dc9fd5c9ffdad","status":"passed","time":{"start":1724733474319,"stop":1724733474319,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"91ff78dc5a767b91","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}}]},"tags":[]},"source":"dead64fe3d4f484d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/debf2b82465b0240.json b/allure-report/data/test-cases/debf2b82465b0240.json new file mode 100644 index 00000000000..0e2cca495d9 --- /dev/null +++ b/allure-report/data/test-cases/debf2b82465b0240.json @@ -0,0 +1 @@ +{"uid":"debf2b82465b0240","name":"Testing digital_root function","fullName":"kyu_6.sum_of_digits_digital_root.test_digital_root.DigitalRootTestCase#test_digital_root","historyId":"3d4d9d606fbf24bad8abb0f0f85e6130","time":{"start":1724735128961,"stop":1724735128961,"duration":0},"description":"\n In this kata, you must create a digital root function.\n\n A digital root is the recursive sum of all the digits\n in a number. Given n, take the sum of the digits of n.\n If that value has more than one digit, continue reducing\n in this way until a single-digit number is produced. This\n is only applicable to the natural numbers.\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"fab45acdd775eb62","name":"stdout","source":"fab45acdd775eb62.txt","type":"text/plain","size":611}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"40cf8e66ad985f0e","status":"passed","time":{"start":1724733474850,"stop":1724733474850,"duration":0}}],"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"1152e12f582a6d83.json","parameterValues":[]} \ No newline at end of file +{"uid":"deed80da6e08bd69","name":"'fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e9ba7465215b13fc","name":"stdout","source":"e9ba7465215b13fc.txt","type":"text/plain","size":611}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"95172229a5a9ad6","status":"passed","time":{"start":1724733474850,"stop":1724733474850,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"1152e12f582a6d83","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}}]},"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"deed80da6e08bd69.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c7106989a12e3c0a.json b/allure-report/data/test-cases/df0c490941a6877a.json similarity index 65% rename from allure-report/data/test-cases/c7106989a12e3c0a.json rename to allure-report/data/test-cases/df0c490941a6877a.json index f07bcd2bb3b..591cb4a4747 100644 --- a/allure-report/data/test-cases/c7106989a12e3c0a.json +++ b/allure-report/data/test-cases/df0c490941a6877a.json @@ -1 +1 @@ -{"uid":"c7106989a12e3c0a","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e5822ae7754d2e8","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"c7106989a12e3c0a.json","parameterValues":[]} \ No newline at end of file +{"uid":"df0c490941a6877a","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ca423ea5ac901436","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"c7106989a12e3c0a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"df0c490941a6877a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/62ca3121cbd75dda.json b/allure-report/data/test-cases/df0cebb647c4d6ba.json similarity index 69% rename from allure-report/data/test-cases/62ca3121cbd75dda.json rename to allure-report/data/test-cases/df0cebb647c4d6ba.json index 1b30a80265a..024994b915d 100644 --- a/allure-report/data/test-cases/62ca3121cbd75dda.json +++ b/allure-report/data/test-cases/df0cebb647c4d6ba.json @@ -1 +1 @@ -{"uid":"62ca3121cbd75dda","name":"All chars are in lower case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_all_lower","historyId":"124f2add699f3e2269c311afae219c6e","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in lower case\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"85584e5ea4131ab","name":"stdout","source":"85584e5ea4131ab.txt","type":"text/plain","size":639}],"parameters":[],"stepsCount":9,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"INTEGERS"},{"name":"feature","value":"Aggregations"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"story","value":"Sum of Intervals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d611744698a52752","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"acc95e26a53d92ff.json","parameterValues":[]} \ No newline at end of file +{"uid":"e03974f538ea8ee6","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"56a8d88c2e7e082f","name":"stdout","source":"56a8d88c2e7e082f.txt","type":"text/plain","size":639}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"INTEGERS"},{"name":"feature","value":"Aggregations"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"story","value":"Sum of Intervals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1728ec761d912068","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"acc95e26a53d92ff","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}}]},"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"e03974f538ea8ee6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/776a48c95cfacbf7.json b/allure-report/data/test-cases/e0851c0ba53ec6a9.json similarity index 69% rename from allure-report/data/test-cases/776a48c95cfacbf7.json rename to allure-report/data/test-cases/e0851c0ba53ec6a9.json index f38d74639ea..4a53fdc4a35 100644 --- a/allure-report/data/test-cases/776a48c95cfacbf7.json +++ b/allure-report/data/test-cases/e0851c0ba53ec6a9.json @@ -1 +1 @@ -{"uid":"776a48c95cfacbf7","name":"Testing gap function","fullName":"kyu_7.find_the_longest_gap.test_gap.GapTestCase#test_gap","historyId":"629f8f3c77ceed21b9aefeb6ebebc433","time":{"start":1724735129102,"stop":1724735129102,"duration":0},"description":"\n Testing gap function with various test inputs\n\n A binary gap within a positive number num is\n any sequence of consecutive zeros that is\n surrounded by ones at both ends in the binary\n representation of num.\n\n The gap function should return the length of\n its longest binary gap.\n\n The function should return 0 if num doesn't\n contain a binary gap.\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have Dog arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 5 arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have good arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 50lb arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have brown arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":6,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cc5f43f6454a1720","name":"stdout","source":"cc5f43f6454a1720.txt","type":"text/plain","size":148}],"parameters":[],"stepsCount":7,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Make Class"},{"name":"parentSuite","value":"Beginner"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"ea06cb7ae28c8945.json","parameterValues":[]} \ No newline at end of file +{"uid":"e21dc9fd5c9ffdad","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have Dog arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 5 arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have good arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 50lb arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have brown arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4f8b5b6368092f66","name":"stdout","source":"4f8b5b6368092f66.txt","type":"text/plain","size":148}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Make Class"},{"name":"parentSuite","value":"Beginner"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"e21dc9fd5c9ffdad.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e2620475a1119269.json b/allure-report/data/test-cases/e2620475a1119269.json deleted file mode 100644 index 7d0dc6be82c..00000000000 --- a/allure-report/data/test-cases/e2620475a1119269.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"e2620475a1119269","name":"Testing 'vaporcode' function","fullName":"kyu_7.vaporcode.test_vaporcode.VaporcodeTestCase#test_vaporcode","historyId":"91791ed1a852f76f936407ccb3d2dbaa","time":{"start":1724733474507,"stop":1724733474507,"duration":0},"description":"\n Testing 'vaporcode' function\n :return:\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"93af2f644721a146","name":"stdout","source":"93af2f644721a146.txt","type":"text/plain","size":277}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAY"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"77e7a047aea456b4.json","parameterValues":[]} \ No newline at end of file +{"uid":"e41551e078ed42ea","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"27155577e4b86a95","name":"stdout","source":"27155577e4b86a95.txt","type":"text/plain","size":277}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAY"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"e41551e078ed42ea.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e5822ae7754d2e8.json b/allure-report/data/test-cases/e5822ae7754d2e8.json deleted file mode 100644 index 71f4b928b16..00000000000 --- a/allure-report/data/test-cases/e5822ae7754d2e8.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"e5822ae7754d2e8","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"e5822ae7754d2e8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/547f04beeb8e83b4.json b/allure-report/data/test-cases/e5ae32dea8d8e5c3.json similarity index 71% rename from allure-report/data/test-cases/547f04beeb8e83b4.json rename to allure-report/data/test-cases/e5ae32dea8d8e5c3.json index 08b974e166a..86b2d7fb719 100644 --- a/allure-report/data/test-cases/547f04beeb8e83b4.json +++ b/allure-report/data/test-cases/e5ae32dea8d8e5c3.json @@ -1 +1 @@ -{"uid":"547f04beeb8e83b4","name":"Testing men_from_boys function","fullName":"kyu_7.sort_out_the_men_from_boys.test_men_from_boys.MenFromBoysTestCase#test_men_from_boys","historyId":"94e7f25439d88c0d2dae964ef4a033cd","time":{"start":1724735129258,"stop":1724735129258,"duration":0},"description":"\n Testing men_from_boys function with\n various test inputs\n\n Scenario\n Now that the competition gets tough it\n will Sort out the men from the boys .\n\n Men are the Even numbers and Boys are\n the odd !alt !alt\n\n Task\n Given an array/list [] of n integers ,\n Separate The even numbers from the odds ,\n or Separate the men from the boys !alt !alt\n\n Notes\n Return an array/list where Even numbers\n come first then odds.\n Since , Men are stronger than Boys ,\n Then Even numbers in ascending order\n While odds in descending.\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"99c79ea3adfa82ee","name":"stdout","source":"99c79ea3adfa82ee.txt","type":"text/plain","size":2146}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9bb9bf100d008741","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"b78c37ec3b0f496f.json","parameterValues":[]} \ No newline at end of file +{"uid":"e6a3da330525d2f4","name":"Testing to_table function","fullName":"kyu_6.array_to_html_table.test_list_to_html_table.ArrayToTableTestCase#test_array_to_table_function","historyId":"d7b951f3d87d7ec30599f08ae5567eb7","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5a6636ef2e259cf6","name":"stdout","source":"5a6636ef2e259cf6.txt","type":"text/plain","size":2146}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6a793815cad01bd2","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"b78c37ec3b0f496f","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"e6a3da330525d2f4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e6d62aae7d602336.json b/allure-report/data/test-cases/e6d62aae7d602336.json new file mode 100644 index 00000000000..d62a62d3879 --- /dev/null +++ b/allure-report/data/test-cases/e6d62aae7d602336.json @@ -0,0 +1 @@ +{"uid":"e6d62aae7d602336","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_test","historyId":"eb0582ce0674121869dd4f6fce46e7f3","time":{"start":1724735129367,"stop":1724735129367,"duration":0},"description":"\n 3 is not a square number\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d42f3c0595488474","name":"stdout","source":"d42f3c0595488474.txt","type":"text/plain","size":23}],"parameters":[],"stepsCount":1,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"ce50dc4c6a1469d8.json","parameterValues":[]} \ No newline at end of file +{"uid":"e99ff83f7419b047","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f200722e18d9d59a","name":"stdout","source":"f200722e18d9d59a.txt","type":"text/plain","size":23}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"e99ff83f7419b047.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/55242408764fe7c9.json b/allure-report/data/test-cases/e9a0c341753d9526.json similarity index 72% rename from allure-report/data/test-cases/55242408764fe7c9.json rename to allure-report/data/test-cases/e9a0c341753d9526.json index 4d8a935343a..6cab4199f5c 100644 --- a/allure-report/data/test-cases/55242408764fe7c9.json +++ b/allure-report/data/test-cases/e9a0c341753d9526.json @@ -1 +1 @@ -{"uid":"55242408764fe7c9","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d25c0f30c04fe1a7","name":"stdout","source":"d25c0f30c04fe1a7.txt","type":"text/plain","size":1013}],"parameters":[],"stepsCount":5,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"story","value":"Row of the odd triangle"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"55242408764fe7c9.json","parameterValues":[]} \ No newline at end of file +{"uid":"e9a0c341753d9526","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"22f31b147f604ade","name":"stdout","source":"22f31b147f604ade.txt","type":"text/plain","size":1013}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"story","value":"Row of the odd triangle"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"e9a0c341753d9526.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a0cc441d7d4eb4dd.json b/allure-report/data/test-cases/e9aaea22e808b4eb.json similarity index 65% rename from allure-report/data/test-cases/a0cc441d7d4eb4dd.json rename to allure-report/data/test-cases/e9aaea22e808b4eb.json index 13c1b416e58..29567478033 100644 --- a/allure-report/data/test-cases/a0cc441d7d4eb4dd.json +++ b/allure-report/data/test-cases/e9aaea22e808b4eb.json @@ -1 +1 @@ -{"uid":"a0cc441d7d4eb4dd","name":"String with alphabet chars only","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_alpha_only","historyId":"f1e3ad74179a106b1d5dc35a6ffe21fa","time":{"start":1724735128774,"stop":1724735128774,"duration":0},"description":"\n Test string with alphabet chars only\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2b5b6c744b764be6","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"3edaeb1c9114b312.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"ee4f0501c1152713","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"91ed862dacbec840","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"3edaeb1c9114b312","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ee4f0501c1152713.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/1585a2916e07d272.json b/allure-report/data/test-cases/ef7cb2e79441187e.json
similarity index 65%
rename from allure-report/data/test-cases/1585a2916e07d272.json
rename to allure-report/data/test-cases/ef7cb2e79441187e.json
index 88eb2b402fb..b7f7db0e0ec 100644
--- a/allure-report/data/test-cases/1585a2916e07d272.json
+++ b/allure-report/data/test-cases/ef7cb2e79441187e.json
@@ -1 +1 @@
-{"uid":"1585a2916e07d272","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an un-existing item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"45fa6f11637998ca","name":"stdout","source":"45fa6f11637998ca.txt","type":"text/plain","size":378}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"1585a2916e07d272.json","parameterValues":[]} \ No newline at end of file +{"uid":"ef7cb2e79441187e","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an un-existing item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e497f0d93067cd8e","name":"stdout","source":"e497f0d93067cd8e.txt","type":"text/plain","size":378}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"ef7cb2e79441187e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/14e29fc6b385d9d8.json b/allure-report/data/test-cases/ef7e94367cfcafa4.json similarity index 62% rename from allure-report/data/test-cases/14e29fc6b385d9d8.json rename to allure-report/data/test-cases/ef7e94367cfcafa4.json index 099fd8e8f7d..c8c09b50a38 100644 --- a/allure-report/data/test-cases/14e29fc6b385d9d8.json +++ b/allure-report/data/test-cases/ef7e94367cfcafa4.json @@ -1 +1 @@ -{"uid":"14e29fc6b385d9d8","name":"Testing 'DefaultList' class: __getitem__","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_basic","historyId":"7dba0545991d74ec4981bfb3eea48559","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c6f68f6f0d4b074f","name":"stdout","source":"c6f68f6f0d4b074f.txt","type":"text/plain","size":371}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"40b6991ee66facde","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"14e29fc6b385d9d8.json","parameterValues":[]} \ No newline at end of file +{"uid":"ef7e94367cfcafa4","name":"Testing 'DefaultList' class: __getitem__","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_basic","historyId":"7dba0545991d74ec4981bfb3eea48559","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a140c6342ce1ee58","name":"stdout","source":"a140c6342ce1ee58.txt","type":"text/plain","size":371}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cc5bed1d964110c","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"14e29fc6b385d9d8","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"ef7e94367cfcafa4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f0d79dba84dbdf82.json b/allure-report/data/test-cases/f0d79dba84dbdf82.json deleted file mode 100644 index 631a34f780e..00000000000 --- a/allure-report/data/test-cases/f0d79dba84dbdf82.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"f0d79dba84dbdf82","name":"Testing length function","fullName":"kyu_7.fun_with_lists_length.test_length.LengthTestCase#test_length","historyId":"b71e871d53b429aef63593ea1f41c8bc","time":{"start":1724735129117,"stop":1724735129117,"duration":0},"description":"\n Testing length function\n\n The method length, which accepts a linked list\n (head), and returns the length of the list.\n :return:\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"8316509a5b8b5aee.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"f4ad45627654b5fc","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"f4ad45627654b5fc.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/f50d911c93ffbcb0.json b/allure-report/data/test-cases/f50d911c93ffbcb0.json
new file mode 100644
index 00000000000..27f17000fb4
--- /dev/null
+++ b/allure-report/data/test-cases/f50d911c93ffbcb0.json
@@ -0,0 +1 @@
+{"uid":"f50d911c93ffbcb0","name":"Testing remove_char function","fullName":"kyu_8.remove_first_and_last_character.test_remove_char.RemoveCharTestCase#test_remove_char","historyId":"094915dd36d829c22ed2375a32962ac5","time":{"start":1724735129633,"stop":1724735129633,"duration":0},"description":"\n Test that 'remove_char' function\n removes the first and\n last characters of a string.\n :return:\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"917768a471c3713a","name":"stdout","source":"917768a471c3713a.txt","type":"text/plain","size":225}],"parameters":[],"stepsCount":2,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Strip Comments"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"3f5cda838e1e2c35","status":"passed","time":{"start":1724733472421,"stop":1724733472437,"duration":16}}],"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"5c64823a2a73f974.json","parameterValues":[]} \ No newline at end of file +{"uid":"f711bbcd16ab2119","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1724735127282,"stop":1724735127297,"duration":15},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9d173a5e0d4bb0c8","name":"stdout","source":"9d173a5e0d4bb0c8.txt","type":"text/plain","size":225}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Strip Comments"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1bbe34ba42279f71","status":"passed","time":{"start":1724733472421,"stop":1724733472437,"duration":16}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"5c64823a2a73f974","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"f711bbcd16ab2119.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dabab8081cda2c59.json b/allure-report/data/test-cases/f72e37459a6b99ff.json similarity index 73% rename from allure-report/data/test-cases/dabab8081cda2c59.json rename to allure-report/data/test-cases/f72e37459a6b99ff.json index 3d6b8717c58..a5839317a96 100644 --- a/allure-report/data/test-cases/dabab8081cda2c59.json +++ b/allure-report/data/test-cases/f72e37459a6b99ff.json @@ -1 +1 @@ -{"uid":"dabab8081cda2c59","name":"Testing number_of_sigfigs function","fullName":"kyu_7.significant_figures.test_number_of_sigfigs.NumberOfSigFigsTestCase#test_number_of_sigfigs","historyId":"3b2ebb1924dbc4e6a73dc5dda19dd323","time":{"start":1724733474413,"stop":1724733474413,"duration":0},"description":"\n Testing number_of_sigfigs function\n with various test inputs\n :return:\n ","descriptionHtml":"Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"167e62bfea691dff","name":"stdout","source":"167e62bfea691dff.txt","type":"text/plain","size":601}],"parameters":[],"stepsCount":3,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"12da189269ca1ca6","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"99f691b62c390084.json","parameterValues":[]} \ No newline at end of file +{"uid":"f80099cf6c294d2b","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f753b26a6d68bf5b","name":"stdout","source":"f753b26a6d68bf5b.txt","type":"text/plain","size":601}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a96041a690fcc058","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"99f691b62c390084","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"f80099cf6c294d2b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/28404a37037093b2.json b/allure-report/data/test-cases/f81d7a6e8f8b1259.json similarity index 74% rename from allure-report/data/test-cases/28404a37037093b2.json rename to allure-report/data/test-cases/f81d7a6e8f8b1259.json index aeb6757d630..f5f45bd2e9e 100644 --- a/allure-report/data/test-cases/28404a37037093b2.json +++ b/allure-report/data/test-cases/f81d7a6e8f8b1259.json @@ -1 +1 @@ -{"uid":"28404a37037093b2","name":"Testing pig_it function","fullName":"kyu_5.simple_pig_latin.test_pig_it.PigItTestCase#test_pig_it","historyId":"c5f1cfe64ff8d3a4f16a4166c571797e","time":{"start":1724733472983,"stop":1724733472983,"duration":0},"description":"\n Testing pig_it function\n\n The function should mpve the first letter of each\n word to the end of it, then add \"ay\" to the end\n of the word. Leave punctuation marks untouched.\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4646d812c4a39ce","name":"stdout","source":"4646d812c4a39ce.txt","type":"text/plain","size":554}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"f8cc7e1ba1a4852f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ffd2584e60c021f7.json b/allure-report/data/test-cases/f90c5e53432ea6c2.json similarity index 66% rename from allure-report/data/test-cases/ffd2584e60c021f7.json rename to allure-report/data/test-cases/f90c5e53432ea6c2.json index f055449e425..94db8bf2c5e 100644 --- a/allure-report/data/test-cases/ffd2584e60c021f7.json +++ b/allure-report/data/test-cases/f90c5e53432ea6c2.json @@ -1 +1 @@ -{"uid":"ffd2584e60c021f7","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Append the list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1aaba40705e2fc47","name":"stdout","source":"1aaba40705e2fc47.txt","type":"text/plain","size":261}],"parameters":[],"stepsCount":4,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"ffd2584e60c021f7.json","parameterValues":[]} \ No newline at end of file +{"uid":"f90c5e53432ea6c2","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Append the list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f18b0e548340aa4f","name":"stdout","source":"f18b0e548340aa4f.txt","type":"text/plain","size":261}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"f90c5e53432ea6c2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b98125cb150cd794.json b/allure-report/data/test-cases/fa5b03edd274b2cd.json similarity index 57% rename from allure-report/data/test-cases/b98125cb150cd794.json rename to allure-report/data/test-cases/fa5b03edd274b2cd.json index 9e1df5562d3..381eba9604e 100644 --- a/allure-report/data/test-cases/b98125cb150cd794.json +++ b/allure-report/data/test-cases/fa5b03edd274b2cd.json @@ -1 +1 @@ -{"uid":"b98125cb150cd794","name":"Testing the 'pyramid' function","fullName":"kyu_6.pyramid_array.test_pyramid_array.PyramidTestCase#test_pyramid","historyId":"73977fc23d0427de5570dbdeaca30321","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"description":"\n The 'pyramid' function should return\n an Array of ascending length subarrays.\n\n Note: the subarrays should be filled with 1s.\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5fc6cabc1aa63064","name":"stdout","source":"5fc6cabc1aa63064.txt","type":"text/plain","size":565}],"parameters":[],"stepsCount":10,"hasContent":true,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"hasContent":false,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"fca0a479e6a9caa.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d3cdbdd9e8f95c74.json b/allure-report/data/test-cases/fcd8cc6f9f4777c4.json similarity index 74% rename from allure-report/data/test-cases/d3cdbdd9e8f95c74.json rename to allure-report/data/test-cases/fcd8cc6f9f4777c4.json index 8ef31cdf892..986a3820e3e 100644 --- a/allure-report/data/test-cases/d3cdbdd9e8f95c74.json +++ b/allure-report/data/test-cases/fcd8cc6f9f4777c4.json @@ -1 +1 @@ -{"uid":"d3cdbdd9e8f95c74","name":"Testing gap function","fullName":"kyu_7.find_the_longest_gap.test_gap.GapTestCase#test_gap","historyId":"629f8f3c77ceed21b9aefeb6ebebc433","time":{"start":1724733474257,"stop":1724733474257,"duration":0},"description":"\n Testing gap function with various test inputs\n\n A binary gap within a positive number num is\n any sequence of consecutive zeros that is\n surrounded by ones at both ends in the binary\n representation of num.\n\n The gap function should return the length of\n its longest binary gap.\n\n The function should return 0 if num doesn't\n contain a binary gap.\n :return:\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1fc52e2c49c9d723","name":"stdout","source":"1fc52e2c49c9d723.txt","type":"text/plain","size":225}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Strip Comments"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"1bbe34ba42279f71.json","parameterValues":[]} \ No newline at end of file +{"uid":"102a91ff9d2e2c1f","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1724733472421,"stop":1724733472437,"duration":16},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2fb64bb60201538c","name":"stdout","source":"2fb64bb60201538c.txt","type":"text/plain","size":225}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Strip Comments"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"102a91ff9d2e2c1f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7c3ec7eab2e0be6d.json b/allure-report/data/test-cases/108dd2ab8a90859d.json similarity index 61% rename from allure-report/data/test-cases/7c3ec7eab2e0be6d.json rename to allure-report/data/test-cases/108dd2ab8a90859d.json index 7c7683c1b09..3b8b067f22b 100644 --- a/allure-report/data/test-cases/7c3ec7eab2e0be6d.json +++ b/allure-report/data/test-cases/108dd2ab8a90859d.json @@ -1 +1 @@ -{"uid":"7c3ec7eab2e0be6d","name":"Testing 'count_sheeps' function: bad input","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_bad_input","historyId":"4837bd231004cf7ec289887c52c12796","time":{"start":1724735129414,"stop":1724735129430,"duration":16},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like null/undefined\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1732428194179,"stop":1732428194179,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"LOOPS"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"33fff97900a7d8bc","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"54043a9fba80789b","status":"passed","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"98d0f495e6dcba7e","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"df3147d31fee6968","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"1265911f14bcd919.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/12688af3a6e6b4d.json b/allure-report/data/test-cases/12688af3a6e6b4d.json new file mode 100644 index 00000000000..95027662db0 --- /dev/null +++ b/allure-report/data/test-cases/12688af3a6e6b4d.json @@ -0,0 +1 @@ +{"uid":"12688af3a6e6b4d","name":"Testing largestPower function","fullName":"kyu_7.powers_of_3.test_largest_power.LargestPowerTestCase#test_largest_power","historyId":"026739760bca73e921f8e5d35d9329cf","time":{"start":1724733474366,"stop":1724733474366,"duration":0},"description":"\n Testing largestPower function\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a140c6342ce1ee58","name":"stdout","source":"a140c6342ce1ee58.txt","type":"text/plain","size":371}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cc5bed1d964110c","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"14e29fc6b385d9d8","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"ef7e94367cfcafa4.json","parameterValues":[]} \ No newline at end of file +{"uid":"12ac45051c49f01a","name":"Testing 'DefaultList' class: __getitem__","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_basic","historyId":"7dba0545991d74ec4981bfb3eea48559","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ad44f1f08939323f","name":"stdout","source":"ad44f1f08939323f.txt","type":"text/plain","size":371}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"12ac45051c49f01a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/12f0442ef33f054e.json b/allure-report/data/test-cases/12f0442ef33f054e.json new file mode 100644 index 00000000000..0f9f7bd2dd9 --- /dev/null +++ b/allure-report/data/test-cases/12f0442ef33f054e.json @@ -0,0 +1 @@ +{"uid":"12f0442ef33f054e","name":"String with alphabet chars only","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_alpha_only","historyId":"f1e3ad74179a106b1d5dc35a6ffe21fa","time":{"start":1732428195473,"stop":1732428195473,"duration":0},"description":"\n Test string with alphabet chars only.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"ee2fa2d0000577e9","name":"stdout","source":"ee2fa2d0000577e9.txt","type":"text/plain","size":908}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":14,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"DECLARATIVE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PROGRAMMING"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ADVANCED"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2348115dae27ed81","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"aca9d99cb0e5842e","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}}]},"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","PROGRAMMING","FUNDAMENTALS","FEATURES","ADVANCED"]},"source":"ace382695affabdf.json","parameterValues":[]} \ No newline at end of file +{"uid":"13ca3a7cd8b0e3af","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724735127438,"stop":1724735127453,"duration":15},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3a4c00d99760de4b","name":"stdout","source":"3a4c00d99760de4b.txt","type":"text/plain","size":908}],"parameters":[],"hasContent":true,"stepsCount":14,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"DECLARATIVE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PROGRAMMING"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ADVANCED"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","PROGRAMMING","FUNDAMENTALS","FEATURES","ADVANCED"]},"source":"13ca3a7cd8b0e3af.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/15008ede7bd87a18.json b/allure-report/data/test-cases/15008ede7bd87a18.json deleted file mode 100644 index bc081686813..00000000000 --- a/allure-report/data/test-cases/15008ede7bd87a18.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"15008ede7bd87a18","name":"Testing the 'unique_in_order' function","fullName":"kyu_6.unique_in_order.test_unique_in_order.UniqueInOrderTestCase#test_unique_in_order","historyId":"9cff2d5d4d73fbc92b1c7c29d738384f","time":{"start":1724735128977,"stop":1724735128977,"duration":0},"description":"\n Testing the 'unique_in_order' function\n with various test data\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194667,"stop":1732428194667,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Insert items to the list","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9f02852e3aa10b6d","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"693d19da33d622de","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2c78d4954ac14f9e","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"93b3042e12ae0dc2","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"1532fae746d0bb3a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/158f20a061140f84.json b/allure-report/data/test-cases/158f20a061140f84.json new file mode 100644 index 00000000000..21e9c4255e3 --- /dev/null +++ b/allure-report/data/test-cases/158f20a061140f84.json @@ -0,0 +1 @@ +{"uid":"158f20a061140f84","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_test","historyId":"eb0582ce0674121869dd4f6fce46e7f3","time":{"start":1732428196079,"stop":1732428196079,"duration":0},"description":"\n 3 is not a square number\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3dc83265322e5aba","name":"stdout","source":"3dc83265322e5aba.txt","type":"text/plain","size":204}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"aefb4681bbbff0c9","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d65c16a1b47d468e","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"5e6aa533c6c0fafa.json","parameterValues":[]} \ No newline at end of file +{"uid":"15dbab6d625f40d3","name":"Testing dirReduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"880a2c92c8612a83","name":"stdout","source":"880a2c92c8612a83.txt","type":"text/plain","size":204}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"15dbab6d625f40d3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/15f47b991f284575.json b/allure-report/data/test-cases/15f47b991f284575.json new file mode 100644 index 00000000000..c7e20dc063a --- /dev/null +++ b/allure-report/data/test-cases/15f47b991f284575.json @@ -0,0 +1 @@ +{"uid":"15f47b991f284575","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":30,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1732428194156,"stop":1732428194156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b9ab4feb44c59984","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}},{"uid":"837e4ce24ac45efb","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"7f90afc62f8400f4","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}},{"uid":"a921030da8c9a520","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}}]},"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"15f47b991f284575.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/161e5fcc0f247.json b/allure-report/data/test-cases/161e5fcc0f247.json new file mode 100644 index 00000000000..3fdf9b7217e --- /dev/null +++ b/allure-report/data/test-cases/161e5fcc0f247.json @@ -0,0 +1 @@ +{"uid":"161e5fcc0f247","name":"Testing 'solution' function","fullName":"kyu_7.pull_your_words_together_man.test_sentencify.SentencifyTestCase#test_sentencify","historyId":"5821e6355bce2a3bf46d4ce3e55de034","time":{"start":1724735129196,"stop":1724735129196,"duration":0},"description":"\n Testing 'sentencify' function.\n\n The function should:\n\n 1. Capitalise the first letter of the first word.\n 2. Add a period (.) to the end of the sentence.\n 3. Join the words into a complete string, with spaces.\n 4. Do no other manipulation on the words.\n\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"da9065dd6d539fab","name":"stdout","source":"da9065dd6d539fab.txt","type":"text/plain","size":2146}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Array to HTML table"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"6a793815cad01bd2.json","parameterValues":[]} \ No newline at end of file +{"uid":"16a9ca9919e5cef5","name":"Testing to_table function","fullName":"kyu_6.array_to_html_table.test_list_to_html_table.ArrayToTableTestCase#test_array_to_table_function","historyId":"d7b951f3d87d7ec30599f08ae5567eb7","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d6c5e78c2bca1b60","name":"stdout","source":"d6c5e78c2bca1b60.txt","type":"text/plain","size":2146}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Array to HTML table"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"16a9ca9919e5cef5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/12ce3777e030dbb5.json b/allure-report/data/test-cases/16f7f5e029216efb.json similarity index 66% rename from allure-report/data/test-cases/12ce3777e030dbb5.json rename to allure-report/data/test-cases/16f7f5e029216efb.json index 7956fbaf5f6..bc7f09ed7da 100644 --- a/allure-report/data/test-cases/12ce3777e030dbb5.json +++ b/allure-report/data/test-cases/16f7f5e029216efb.json @@ -1 +1 @@ -{"uid":"12ce3777e030dbb5","name":"Testing permute_a_palindrome (empty string)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_empty_string","historyId":"9f2093620517aae286b85ccc9f40b534","time":{"start":1724733474007,"stop":1724733474007,"duration":0},"descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1732428194139,"stop":1732428194139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1732428194147,"stop":1732428194147,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9c2fc5bac7417dd0","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}},{"uid":"3d13030ecd2583e8","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"675849fee1009391","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}},{"uid":"c1f2317d20109e13","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"1700dd3f253e8636.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/17f807e7e2cad355.json b/allure-report/data/test-cases/17f807e7e2cad355.json deleted file mode 100644 index 92b0a9b2109..00000000000 --- a/allure-report/data/test-cases/17f807e7e2cad355.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"17f807e7e2cad355","name":"Testing 'save' function: positive","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_positive","historyId":"b1ff2214ba100eb1c8bc62e73e12889e","time":{"start":1724733474241,"stop":1724733474241,"duration":0},"description":"\n Testing 'save' function: positive\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert training","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert battle","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1e123d763e6ea7e5","name":"stdout","source":"1e123d763e6ea7e5.txt","type":"text/plain","size":67}],"parameters":[],"hasContent":true,"stepsCount":12,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"1938e37bf1525466.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/196d34645221ebb4.json b/allure-report/data/test-cases/196d34645221ebb4.json new file mode 100644 index 00000000000..c7bff6ccd81 --- /dev/null +++ b/allure-report/data/test-cases/196d34645221ebb4.json @@ -0,0 +1 @@ +{"uid":"196d34645221ebb4","name":"All chars are in upper case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_all_caps","historyId":"f47162ca0e9bacec154c9094fd33e635","time":{"start":1732428194595,"stop":1732428194595,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in upper case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"676a2b28cd4ab614","name":"stdout","source":"676a2b28cd4ab614.txt","type":"text/plain","size":1079}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"Strings"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Logic"},{"name":"tag","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"2d65aaadaa20d5c2","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"7e0d94f0ee4e397d.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"1a1c24c0cb125454","name":"test_triangle","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_triangle","historyId":"be7068cb1056118b9c0776b1d187601d","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cece8653b698fb5f","name":"stdout","source":"cece8653b698fb5f.txt","type":"text/plain","size":1079}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"Strings"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Logic"},{"name":"tag","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["Algorithms","Logic","Strings"]},"source":"1a1c24c0cb125454.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/fbd4191028146e80.json b/allure-report/data/test-cases/1a8ee4991fa5fcbc.json
similarity index 68%
rename from allure-report/data/test-cases/fbd4191028146e80.json
rename to allure-report/data/test-cases/1a8ee4991fa5fcbc.json
index 432740b3449..2c190a62fcf 100644
--- a/allure-report/data/test-cases/fbd4191028146e80.json
+++ b/allure-report/data/test-cases/1a8ee4991fa5fcbc.json
@@ -1 +1 @@
-{"uid":"fbd4191028146e80","name":"Testing check_root function","fullName":"kyu_7.always_perfect.test_check_root.CheckRootTestCase#test_check_root","historyId":"9c2d30046a2fe35ee19c9d3833ea20a5","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"description":"\n Testing check_root function with various test inputs\n\n A function which takes numbers separated by commas\n in string format and returns the number which is a\n perfect square and the square root of that number.\n\n If string contains other characters than number or\n it has more or less than 4 numbers separated by comma\n function returns \"incorrect input\".\n\n If string contains 4 numbers but not consecutive it\n returns \"not consecutive\".\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3a93f15f0e448e53","name":"stdout","source":"3a93f15f0e448e53.txt","type":"text/plain","size":348}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Who likes it?"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ddf52bfae3cd34f4","status":"passed","time":{"start":1724733474132,"stop":1724733474132,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"57946e73be805e2a","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"d7357eaa8c15ec47.json","parameterValues":[]} \ No newline at end of file +{"uid":"1bdb6e0764902ab4","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e321f5d691b52e57","name":"stdout","source":"e321f5d691b52e57.txt","type":"text/plain","size":348}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Who likes it?"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"1bdb6e0764902ab4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/11b0f4fd11e05b10.json b/allure-report/data/test-cases/1bef76bb610cc3bd.json similarity index 71% rename from allure-report/data/test-cases/11b0f4fd11e05b10.json rename to allure-report/data/test-cases/1bef76bb610cc3bd.json index 7e46fe7efc4..266c7fd85ff 100644 --- a/allure-report/data/test-cases/11b0f4fd11e05b10.json +++ b/allure-report/data/test-cases/1bef76bb610cc3bd.json @@ -1 +1 @@ -{"uid":"11b0f4fd11e05b10","name":"Should return 'Publish!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_publish","historyId":"b4a1fa278aa899a374ebad09960e6cca","time":{"start":1724733474960,"stop":1724733474960,"duration":0},"description":"\n If there are one or two good ideas,\n return 'Publish!',\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing binary_to_string function\n with various test data\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1732428194580,"stop":1732428194580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"BINARY"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FORMATS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"suite","value":"Character Encodings"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8949506fce676285","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"f00b7b6604c5e7e4","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2b38fe6b8a5a46","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"5c281d5272513bfd","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"1d2104b5fa1d29b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1da47ab927a8de42.json b/allure-report/data/test-cases/1da47ab927a8de42.json new file mode 100644 index 00000000000..8f5b6deecc4 --- /dev/null +++ b/allure-report/data/test-cases/1da47ab927a8de42.json @@ -0,0 +1 @@ +{"uid":"1da47ab927a8de42","name":"Testing 'numericals' function","fullName":"kyu_6.numericals_of_string.test_numericals.NumericalsTestCase#test_numericals","historyId":"d2b4dccd0eb8dfd6ef62ac0349f0f6a7","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"description":"\n Testing 'numericals' function\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3e00d2a8f3aaa1eb","name":"stdout","source":"3e00d2a8f3aaa1eb.txt","type":"text/plain","size":253}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"808471d4cfeae814","status":"passed","time":{"start":1724733474632,"stop":1724733474632,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"cd298347a8b67e93","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"9f7fc4731241a976.json","parameterValues":[]} \ No newline at end of file +{"uid":"1f14a6ccebe34b08","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f27833c43953c1b1","name":"stdout","source":"f27833c43953c1b1.txt","type":"text/plain","size":253}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"1f14a6ccebe34b08.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/11b652a05502070f.json b/allure-report/data/test-cases/20ae87fc51fb9338.json similarity index 62% rename from allure-report/data/test-cases/11b652a05502070f.json rename to allure-report/data/test-cases/20ae87fc51fb9338.json index e6d484e06b1..1ffd86d1543 100644 --- a/allure-report/data/test-cases/11b652a05502070f.json +++ b/allure-report/data/test-cases/20ae87fc51fb9338.json @@ -1 +1 @@ -{"uid":"11b652a05502070f","name":"Testing pig_it function","fullName":"kyu_5.simple_pig_latin.test_pig_it.PigItTestCase#test_pig_it","historyId":"c5f1cfe64ff8d3a4f16a4166c571797e","time":{"start":1724735127875,"stop":1724735127875,"duration":0},"description":"\n Testing pig_it function\n\n The function should mpve the first letter of each\n word to the end of it, then add \"ay\" to the end\n of the word. Leave punctuation marks untouched.\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194678,"stop":1732428194678,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Remove items from the list","time":{"start":1732428194678,"stop":1732428194679,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194679,"stop":1732428194679,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194679,"stop":1732428194679,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5519a1e9b61f2ca3","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}},{"uid":"4b8d012f19a4e1e6","status":"passed","time":{"start":1724733473171,"stop":1724733473186,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"51a9aec46de8d878","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}},{"uid":"43c0068fe0a1265e","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"239a317b6e090fd8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a6a0450be3f30fe6.json b/allure-report/data/test-cases/23e61e29448b9218.json similarity index 64% rename from allure-report/data/test-cases/a6a0450be3f30fe6.json rename to allure-report/data/test-cases/23e61e29448b9218.json index 1448c24eadf..5235a6041b0 100644 --- a/allure-report/data/test-cases/a6a0450be3f30fe6.json +++ b/allure-report/data/test-cases/23e61e29448b9218.json @@ -1 +1 @@ -{"uid":"a6a0450be3f30fe6","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Extend the list list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4e2e1868fac6f5c2","name":"stdout","source":"4e2e1868fac6f5c2.txt","type":"text/plain","size":375}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"a6a0450be3f30fe6.json","parameterValues":[]} \ No newline at end of file +{"uid":"23e61e29448b9218","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Extend the list list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cd5591b59d574128","name":"stdout","source":"cd5591b59d574128.txt","type":"text/plain","size":375}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"23e61e29448b9218.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/256a10c9792b808f.json b/allure-report/data/test-cases/256a10c9792b808f.json new file mode 100644 index 00000000000..f889295b23f --- /dev/null +++ b/allure-report/data/test-cases/256a10c9792b808f.json @@ -0,0 +1 @@ +{"uid":"256a10c9792b808f","name":"Testing 'letter_count' function","fullName":"kyu_6.count_letters_in_string.test_count_letters_in_string.CountLettersInStringTestCase#test_count_letters_in_string","historyId":"04bb543ec741bd163e341a33a1623692","time":{"start":1732428194628,"stop":1732428194628,"duration":0},"description":"\n Testing 'letter_count' function\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1732428195606,"stop":1732428195606,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test that a function that given a sequence of strings,\n groups the elements that can be obtained by rotating others,\n ignoring upper or lower cases.\n\n In the event that an element appears more than once in\n the input sequence, only one of them will be taken into\n account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1732428195610,"stop":1732428195610,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"PUZZLES"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4f1172fa5620cc18","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}},{"uid":"924a52587e7b2c82","status":"passed","time":{"start":1724733474054,"stop":1724733474054,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"8655885cb5db7a58","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}},{"uid":"578c3a6cd3e7e40f","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}}]},"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"25fd6f6c5cfe2b58.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2655a1e6934b1850.json b/allure-report/data/test-cases/2655a1e6934b1850.json new file mode 100644 index 00000000000..ad1adb517d9 --- /dev/null +++ b/allure-report/data/test-cases/2655a1e6934b1850.json @@ -0,0 +1 @@ +{"uid":"2655a1e6934b1850","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Append the list","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9c43e0c7813423da","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}},{"uid":"c5ea93b10613ec53","status":"passed","time":{"start":1724733473139,"stop":1724733473139,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"b5a45493f51c1d67","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}},{"uid":"7f890ca68cdfc481","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"2655a1e6934b1850.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/26764a4bab46b2bf.json b/allure-report/data/test-cases/26764a4bab46b2bf.json new file mode 100644 index 00000000000..652bd5dabce --- /dev/null +++ b/allure-report/data/test-cases/26764a4bab46b2bf.json @@ -0,0 +1 @@ +{"uid":"26764a4bab46b2bf","name":"powers function should return an array of unique numbers","fullName":"kyu_7.sum_of_powers_of_2.test_sum_of_powers_of_2.SumOfPowerOfTwoTestCase#test_powers","historyId":"489e3070dc83756c411301400dd6e3c8","time":{"start":1724735129289,"stop":1724735129289,"duration":0},"description":"\n The function powers takes a single parameter,\n the number n, and should return an array of unique numbers.\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d5eb9c17e95fe424","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"34febd97f08d8df7","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"26cf86ca9eda4b5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cdb95614a08f7813.json b/allure-report/data/test-cases/26f23a936b51b328.json similarity index 65% rename from allure-report/data/test-cases/cdb95614a08f7813.json rename to allure-report/data/test-cases/26f23a936b51b328.json index 766e70b8a1d..b837cdf069f 100644 --- a/allure-report/data/test-cases/cdb95614a08f7813.json +++ b/allure-report/data/test-cases/26f23a936b51b328.json @@ -1 +1 @@ -{"uid":"cdb95614a08f7813","name":"String with mixed type of chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_dup_mixed","historyId":"befc81f16d3ea9a4d57ecd3fed78faff","time":{"start":1724733473929,"stop":1724733473929,"duration":0},"description":"\n Test string with mixed type of chars\n :return:\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"60434b32a4fa91ba","name":"stdout","source":"60434b32a4fa91ba.txt","type":"text/plain","size":530}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"58ec93395b112a8f.json","parameterValues":[]} \ No newline at end of file +{"uid":"27b26e7a6523571a","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cb2ee8571e9e5841","name":"stdout","source":"cb2ee8571e9e5841.txt","type":"text/plain","size":530}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"27b26e7a6523571a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/27d124696efa8c6c.json b/allure-report/data/test-cases/27d124696efa8c6c.json new file mode 100644 index 00000000000..a418574431d --- /dev/null +++ b/allure-report/data/test-cases/27d124696efa8c6c.json @@ -0,0 +1 @@ +{"uid":"27d124696efa8c6c","name":"Testing 'count_sheeps' function: empty list","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_empty_list","historyId":"64d02b3be7358667808060e04863e8f8","time":{"start":1732428196144,"stop":1732428196144,"duration":0},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like empty list\n :return:\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert training","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert battle","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8b00f3eb19799549","name":"stdout","source":"8b00f3eb19799549.txt","type":"text/plain","size":67}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":12,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"72010ab4f2692ae4.json","parameterValues":[]} \ No newline at end of file +{"uid":"286a2c6d22a3ea0b","name":"Testing Warrior class >>> bruce_lee","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_bruce_lee","historyId":"7af7e9479cf2a47a636ae35231bacc9f","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert training","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert battle","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c52989139561013a","name":"stdout","source":"c52989139561013a.txt","type":"text/plain","size":67}],"parameters":[],"hasContent":true,"stepsCount":12,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"286a2c6d22a3ea0b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/28c03a6c5cc24cef.json b/allure-report/data/test-cases/28c03a6c5cc24cef.json new file mode 100644 index 00000000000..89aef4cbda0 --- /dev/null +++ b/allure-report/data/test-cases/28c03a6c5cc24cef.json @@ -0,0 +1 @@ +{"uid":"28c03a6c5cc24cef","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1732428195780,"stop":1732428195781,"duration":1},"description":"\n Testing easy_line function\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_line function\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"38365b0f6f350ca5","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"64d00badde981bd3","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2aa3a63b6fff605a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"fb3ce43e36479ba0","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"28c03a6c5cc24cef.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2951c359ba3fd421.json b/allure-report/data/test-cases/2951c359ba3fd421.json new file mode 100644 index 00000000000..7c0a39d4fef --- /dev/null +++ b/allure-report/data/test-cases/2951c359ba3fd421.json @@ -0,0 +1 @@ +{"uid":"2951c359ba3fd421","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1732428196238,"stop":1732428196239,"duration":1},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196238,"stop":1732428196238,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"48abcc67292a5aa2","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"5b3fc84157197066","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"972d0622d29729c4","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"2c2a3e42bb3933c8","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"2951c359ba3fd421.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/204251456ada0752.json b/allure-report/data/test-cases/2980fd5af6447b30.json similarity index 72% rename from allure-report/data/test-cases/204251456ada0752.json rename to allure-report/data/test-cases/2980fd5af6447b30.json index 0fa4d6760b9..746d049f3c8 100644 --- a/allure-report/data/test-cases/204251456ada0752.json +++ b/allure-report/data/test-cases/2980fd5af6447b30.json @@ -1 +1 @@ -{"uid":"204251456ada0752","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2dcda4c0465e81d2","name":"stdout","source":"2dcda4c0465e81d2.txt","type":"text/plain","size":434}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"204251456ada0752.json","parameterValues":[]} \ No newline at end of file +{"uid":"2980fd5af6447b30","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"660305aec4aa6e06","name":"stdout","source":"660305aec4aa6e06.txt","type":"text/plain","size":434}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"2980fd5af6447b30.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2aa3a63b6fff605a.json b/allure-report/data/test-cases/2aa3a63b6fff605a.json deleted file mode 100644 index a6af894e487..00000000000 --- a/allure-report/data/test-cases/2aa3a63b6fff605a.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"2aa3a63b6fff605a","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"47bd852e88dda4bd","name":"stdout","source":"47bd852e88dda4bd.txt","type":"text/plain","size":554}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f8cc7e1ba1a4852f","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"fb3ce43e36479ba0","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"2aa3a63b6fff605a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2b38fe6b8a5a46.json b/allure-report/data/test-cases/2b38fe6b8a5a46.json deleted file mode 100644 index 70db00d2a78..00000000000 --- a/allure-report/data/test-cases/2b38fe6b8a5a46.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"2b38fe6b8a5a46","name":"Testing binary_to_string function","fullName":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string.SequenceTestCase#test_binary_to_string","historyId":"5e3d4a7b89a7ecee6b57c2383b63527b","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6cceaf28d236f584","name":"stdout","source":"6cceaf28d236f584.txt","type":"text/plain","size":1380}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ASCII"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Character Encodings"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BINARY"},{"name":"tag","value":"FORMATS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9cc84b4c3c851a20","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"5c281d5272513bfd","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["CHARACTER ENCODINGS","STRINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"2b38fe6b8a5a46.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/90a24ba96aea3cfc.json b/allure-report/data/test-cases/2b5bdabfec79d6cf.json similarity index 59% rename from allure-report/data/test-cases/90a24ba96aea3cfc.json rename to allure-report/data/test-cases/2b5bdabfec79d6cf.json index fcf14851caa..2ff60b878f1 100644 --- a/allure-report/data/test-cases/90a24ba96aea3cfc.json +++ b/allure-report/data/test-cases/2b5bdabfec79d6cf.json @@ -1 +1 @@ -{"uid":"90a24ba96aea3cfc","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7efcea1d1ffd3662","name":"stdout","source":"7efcea1d1ffd3662.txt","type":"text/plain","size":544}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNCTIONS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Games"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"dcb40cbe5ee38417","status":"passed","time":{"start":1724733474023,"stop":1724733474023,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"396df158495e2556","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","NUMBERS","GAMES","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"90a24ba96aea3cfc.json","parameterValues":[]} \ No newline at end of file +{"uid":"2b5bdabfec79d6cf","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2862210bad838236","name":"stdout","source":"2862210bad838236.txt","type":"text/plain","size":544}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNCTIONS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Games"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","GAMES","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"2b5bdabfec79d6cf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c37dfc82a096ec09.json b/allure-report/data/test-cases/2b5d1a28c2e7859f.json similarity index 72% rename from allure-report/data/test-cases/c37dfc82a096ec09.json rename to allure-report/data/test-cases/2b5d1a28c2e7859f.json index 943ecad9823..f7479b18fb2 100644 --- a/allure-report/data/test-cases/c37dfc82a096ec09.json +++ b/allure-report/data/test-cases/2b5d1a28c2e7859f.json @@ -1 +1 @@ -{"uid":"c37dfc82a096ec09","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the smallest"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"20308d2341c6b899","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472765,"stop":1724733472765,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"257a5ad111bd69a7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}}]},"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c37dfc82a096ec09.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"2b5d1a28c2e7859f","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the smallest"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"2b5d1a28c2e7859f.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/2b76b55d8c8f82d1.json b/allure-report/data/test-cases/2b76b55d8c8f82d1.json
new file mode 100644
index 00000000000..23c0e6bb4e5
--- /dev/null
+++ b/allure-report/data/test-cases/2b76b55d8c8f82d1.json
@@ -0,0 +1 @@
+{"uid":"2b76b55d8c8f82d1","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1732428194237,"stop":1732428194238,"duration":1},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428194238,"stop":1732428194238,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5b153d545c48d264","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"a530698ca5ed066c","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"614b9e2de4457676","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"e798d2f5cc38e024","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"2b76b55d8c8f82d1.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2b89947e3a3ec46d.json b/allure-report/data/test-cases/2b89947e3a3ec46d.json new file mode 100644 index 00000000000..a180555d5b1 --- /dev/null +++ b/allure-report/data/test-cases/2b89947e3a3ec46d.json @@ -0,0 +1 @@ +{"uid":"2b89947e3a3ec46d","name":"Testing domain_name function","fullName":"kyu_5.extract_the_domain_name_from_url.test_domain_name.DomainNameTestCase#test_domain_name","historyId":"cd64b52319d4c70d68e281e8561ab97f","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1732428194215,"stop":1732428194215,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1732428194217,"stop":1732428194217,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"feature","value":"String"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"90d2f619b6b55a93","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}},{"uid":"eaaef6c05ba4cb98","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"627da61e5891aa44","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}},{"uid":"d8e9539521c4ca00","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"2b89947e3a3ec46d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2b9309fd398214a5.json b/allure-report/data/test-cases/2b9309fd398214a5.json deleted file mode 100644 index 72d4199f7da..00000000000 --- a/allure-report/data/test-cases/2b9309fd398214a5.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"2b9309fd398214a5","name":"Testing 'solution' function","fullName":"kyu_7.pull_your_words_together_man.test_sentencify.SentencifyTestCase#test_sentencify","historyId":"5821e6355bce2a3bf46d4ce3e55de034","time":{"start":1724735129196,"stop":1724735129196,"duration":0},"description":"\n Testing 'sentencify' function.\n\n The function should:\n\n 1. Capitalise the first letter of the first word.\n 2. Add a period (.) to the end of the sentence.\n 3. Join the words into a complete string, with spaces.\n 4. Do no other manipulation on the words.\n\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing array_diff function\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1732428194561,"stop":1732428194561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array.diff"},{"name":"tag","value":"LISTS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4ea31191e1f5ab3b","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"ac81c5ec86387239","status":"passed","time":{"start":1724733473061,"stop":1724733473061,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"dc29e000a4adcd25","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"f52a489cb0add672","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"2bfddef765c09569.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2c6c8c712bf1892f.json b/allure-report/data/test-cases/2c6c8c712bf1892f.json new file mode 100644 index 00000000000..fb4408f2c99 --- /dev/null +++ b/allure-report/data/test-cases/2c6c8c712bf1892f.json @@ -0,0 +1 @@ +{"uid":"2c6c8c712bf1892f","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isogram and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string aba and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string moOse and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1732428195862,"stop":1732428195862,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"428efcfcd43d2531","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}},{"uid":"691701add6daaf89","status":"passed","time":{"start":1724733474304,"stop":1724733474304,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"cd862d92408a60a2","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}},{"uid":"3bd61bc704b417e2","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"2c6c8c712bf1892f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2c78d4954ac14f9e.json b/allure-report/data/test-cases/2c78d4954ac14f9e.json deleted file mode 100644 index 9df8d71c9a9..00000000000 --- a/allure-report/data/test-cases/2c78d4954ac14f9e.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"2c78d4954ac14f9e","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Insert items to the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6344061f744d93d","name":"stdout","source":"6344061f744d93d.txt","type":"text/plain","size":261}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"474af6c568bdf675","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"93b3042e12ae0dc2","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"2c78d4954ac14f9e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2cc2dcb2d1d8eb43.json b/allure-report/data/test-cases/2cc2dcb2d1d8eb43.json new file mode 100644 index 00000000000..463ead7268d --- /dev/null +++ b/allure-report/data/test-cases/2cc2dcb2d1d8eb43.json @@ -0,0 +1 @@ +{"uid":"2cc2dcb2d1d8eb43","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1732428194023,"stop":1732428194025,"duration":2},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1732428194022,"stop":1732428194022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194025,"duration":2},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194025,"stop":1732428194025,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1732428194026,"stop":1732428194026,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c5f3069d223f82c6","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}},{"uid":"68ae9688c7c99a04","status":"passed","time":{"start":1724733472421,"stop":1724733472421,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2460353038ce1955","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}},{"uid":"afdaa298aab7eba8","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"2cc2dcb2d1d8eb43.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2ce701a458e1cd31.json b/allure-report/data/test-cases/2ce701a458e1cd31.json new file mode 100644 index 00000000000..ddcd20ca909 --- /dev/null +++ b/allure-report/data/test-cases/2ce701a458e1cd31.json @@ -0,0 +1 @@ +{"uid":"2ce701a458e1cd31","name":"Test with one char only","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_one_char","historyId":"e3d629a995491cb3a3079998a04583ff","time":{"start":1724733474882,"stop":1724733474882,"duration":0},"description":"\n Test with one char only\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ca423ea5ac901436","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"c7106989a12e3c0a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"df0c490941a6877a.json","parameterValues":[]} \ No newline at end of file +{"uid":"2dc119e05306bc09","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"2dc119e05306bc09.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/458ee4cae9834334.json b/allure-report/data/test-cases/2dcd793cb9c1cce4.json similarity index 73% rename from allure-report/data/test-cases/458ee4cae9834334.json rename to allure-report/data/test-cases/2dcd793cb9c1cce4.json index deefd5f1ee7..f8ae4018de5 100644 --- a/allure-report/data/test-cases/458ee4cae9834334.json +++ b/allure-report/data/test-cases/2dcd793cb9c1cce4.json @@ -1 +1 @@ -{"uid":"458ee4cae9834334","name":"Wolf in the middle of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_in_middle","historyId":"3de540be96edd1a6ef052fccdb3f5cad","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"description":"\n If the wolf is the closest animal to you,\n return \"Pls go away and stop eating my sheep\".\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"22f31b147f604ade","name":"stdout","source":"22f31b147f604ade.txt","type":"text/plain","size":1013}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"story","value":"Row of the odd triangle"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"e9a0c341753d9526.json","parameterValues":[]} \ No newline at end of file +{"uid":"2e9a9a4090c00445","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9cd8266cfd985687","name":"stdout","source":"9cd8266cfd985687.txt","type":"text/plain","size":1013}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"story","value":"Row of the odd triangle"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"2e9a9a4090c00445.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6d22e154a5a83d80.json b/allure-report/data/test-cases/2f407878af91b1de.json similarity index 71% rename from allure-report/data/test-cases/6d22e154a5a83d80.json rename to allure-report/data/test-cases/2f407878af91b1de.json index 0b0db2d2d57..9ec0e1b2511 100644 --- a/allure-report/data/test-cases/6d22e154a5a83d80.json +++ b/allure-report/data/test-cases/2f407878af91b1de.json @@ -1 +1 @@ -{"uid":"6d22e154a5a83d80","name":"Negative numbers","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_numbers","historyId":"baeb278025592b3aed00b5f1bc1265b1","time":{"start":1724733474538,"stop":1724733474538,"duration":0},"description":"\n -1: Negative numbers cannot be square numbers\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a54c971159a9735d","name":"stdout","source":"a54c971159a9735d.txt","type":"text/plain","size":213}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"ARITHMETIC"},{"name":"story","value":"Sum of odd numbers"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a50af3a4d2a7afb5","status":"passed","time":{"start":1724733474460,"stop":1724733474460,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d837297408a13c1e","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","LISTS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"9a325845218dd6ae.json","parameterValues":[]} \ No newline at end of file +{"uid":"302b8c55161cc361","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e2e513778c4c6c4f","name":"stdout","source":"e2e513778c4c6c4f.txt","type":"text/plain","size":213}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"ARITHMETIC"},{"name":"story","value":"Sum of odd numbers"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","LISTS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"302b8c55161cc361.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d1aabae67bc18ba0.json b/allure-report/data/test-cases/307a8cec4e791e32.json similarity index 61% rename from allure-report/data/test-cases/d1aabae67bc18ba0.json rename to allure-report/data/test-cases/307a8cec4e791e32.json index 6bd38ed2d11..b7db9d7b3e9 100644 --- a/allure-report/data/test-cases/d1aabae67bc18ba0.json +++ b/allure-report/data/test-cases/307a8cec4e791e32.json @@ -1 +1 @@ -{"uid":"d1aabae67bc18ba0","name":"Testing 'solution' function","fullName":"kyu_7.substituting_variables_into_strings_padded_numbers.test_solution.SolutionTestCase#test_solution","historyId":"fbdd2daae3e9a5e6dd05fcb0403a88d1","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"description":"\n Testing 'solution' function.\n\n The should return a formatted string.\n The return value should equal \"Value is VALUE\"\n where value is a 5 digit padded number.\n :return:\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"47a613697aa0c71f.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"30b1174850b5a822","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"30b1174850b5a822.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/47f8df09a84d8337.json b/allure-report/data/test-cases/31050b40d7651adc.json
similarity index 64%
rename from allure-report/data/test-cases/47f8df09a84d8337.json
rename to allure-report/data/test-cases/31050b40d7651adc.json
index f7a836a8cc2..4c0699ed4e2 100644
--- a/allure-report/data/test-cases/47f8df09a84d8337.json
+++ b/allure-report/data/test-cases/31050b40d7651adc.json
@@ -1 +1 @@
-{"uid":"47f8df09a84d8337","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6c919aa9e8f6951e","name":"stdout","source":"6c919aa9e8f6951e.txt","type":"text/plain","size":1515}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":13,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Human readable duration format"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d5804044d1767680","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"409595d25cc5d60c","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"47f8df09a84d8337.json","parameterValues":[]} \ No newline at end of file +{"uid":"31050b40d7651adc","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"12f3e703f687ed41","name":"stdout","source":"12f3e703f687ed41.txt","type":"text/plain","size":1515}],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Human readable duration format"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"31050b40d7651adc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/52187b3daff300ae.json b/allure-report/data/test-cases/32703c37c2f9cfbd.json similarity index 55% rename from allure-report/data/test-cases/52187b3daff300ae.json rename to allure-report/data/test-cases/32703c37c2f9cfbd.json index f65cc4e16cb..e29f1c08659 100644 --- a/allure-report/data/test-cases/52187b3daff300ae.json +++ b/allure-report/data/test-cases/32703c37c2f9cfbd.json @@ -1 +1 @@ -{"uid":"52187b3daff300ae","name":"AND logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_and","historyId":"49af4a8ebdc007fac4acbc085138b80e","time":{"start":1724735129586,"stop":1724735129586,"duration":0},"description":"\n And (∧) is the truth-functional\n operator of logical conjunction\n\n The and of a set of operands is true\n if and only if all of its operands are true.\n\n Source:\n https://en.wikipedia.org/wiki/Logical_conjunction\n\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8418aaca0f21809c","name":"stdout","source":"8418aaca0f21809c.txt","type":"text/plain","size":304}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"db267da7b8a1b004.json","parameterValues":[]} \ No newline at end of file +{"uid":"32b8a7a180fb722f","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"697ce25e72082ee1","name":"stdout","source":"697ce25e72082ee1.txt","type":"text/plain","size":304}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"32b8a7a180fb722f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/332b728d7cfdedcf.json b/allure-report/data/test-cases/332b728d7cfdedcf.json new file mode 100644 index 00000000000..f38026afdeb --- /dev/null +++ b/allure-report/data/test-cases/332b728d7cfdedcf.json @@ -0,0 +1 @@ +{"uid":"332b728d7cfdedcf","name":"Testing permute_a_palindrome (negative)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_negative","historyId":"7090b58c62fab362ad673c85c67765af","time":{"start":1724733474007,"stop":1724733474007,"duration":0},"descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"62bd346b3a261fc6","name":"stdout","source":"62bd346b3a261fc6.txt","type":"text/plain","size":676}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LOOPS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"252f381a068f762f","status":"passed","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"df3147d31fee6968","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"98d0f495e6dcba7e.json","parameterValues":[]} \ No newline at end of file +{"uid":"33fff97900a7d8bc","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5d5a8c5ce62738a7","name":"stdout","source":"5d5a8c5ce62738a7.txt","type":"text/plain","size":676}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LOOPS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"33fff97900a7d8bc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9c38060cc376f686.json b/allure-report/data/test-cases/342dee44f5f15fde.json similarity index 56% rename from allure-report/data/test-cases/9c38060cc376f686.json rename to allure-report/data/test-cases/342dee44f5f15fde.json index ca0f8da7bf9..32f18939b58 100644 --- a/allure-report/data/test-cases/9c38060cc376f686.json +++ b/allure-report/data/test-cases/342dee44f5f15fde.json @@ -1 +1 @@ -{"uid":"9c38060cc376f686","name":"move function tests","fullName":"kyu_8.terminal_game_move_function.test_terminal_game_move_function.MoveTestCase#test_move","historyId":"c589035c90d432fb71a99aec4f56ee9e","time":{"start":1724735129680,"stop":1724735129680,"duration":0},"description":"\n The player rolls the dice and moves the number\n of spaces indicated by the dice two times.\n\n Pass position and roll and compare the output\n to the expected result\n :return:\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1732428194618,"stop":1732428194618,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1732428194621,"stop":1732428194621,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Factorial"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e186c7a758de768a","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}},{"uid":"9348c64cc78f5d13","status":"passed","time":{"start":1724733473124,"stop":1724733473124,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"de04793abb90de01","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}},{"uid":"3d3e842542b066f3","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"34a84f898de954b5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3529b67f8df1184b.json b/allure-report/data/test-cases/3529b67f8df1184b.json new file mode 100644 index 00000000000..ebb9f44f2fe --- /dev/null +++ b/allure-report/data/test-cases/3529b67f8df1184b.json @@ -0,0 +1 @@ +{"uid":"3529b67f8df1184b","name":"Testing men_from_boys function","fullName":"kyu_7.sort_out_the_men_from_boys.test_men_from_boys.MenFromBoysTestCase#test_men_from_boys","historyId":"94e7f25439d88c0d2dae964ef4a033cd","time":{"start":1732428195975,"stop":1732428195976,"duration":1},"description":"\n Testing men_from_boys function with\n various test inputs\n\n Scenario\n Now that the competition gets tough it\n will Sort out the men from the boys .\n\n Men are the Even numbers and Boys are\n the odd !alt !alt\n\n Task\n Given an array/list [] of n integers ,\n Separate The even numbers from the odds ,\n or Separate the men from the boys !alt !alt\n\n Notes\n Return an array/list where Even numbers\n come first then odds.\n Since , Men are stronger than Boys ,\n Then Even numbers in ascending order\n While odds in descending.\n :return:\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7f52a9aa50bef455","name":"stdout","source":"7f52a9aa50bef455.txt","type":"text/plain","size":1009}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"Snail"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"7b9876690035f17.json","parameterValues":[]} \ No newline at end of file +{"uid":"35836d979e37575","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"67751593ff534b14","name":"stdout","source":"67751593ff534b14.txt","type":"text/plain","size":1009}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"Snail"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"35836d979e37575.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/35f08e300f5635d6.json b/allure-report/data/test-cases/35f08e300f5635d6.json new file mode 100644 index 00000000000..00ca86acc3d --- /dev/null +++ b/allure-report/data/test-cases/35f08e300f5635d6.json @@ -0,0 +1 @@ +{"uid":"35f08e300f5635d6","name":"Testing 'count_sheeps' function: mixed list","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_mixed_list","historyId":"1b4dd61e36f8ec4ee2f83635d4e16e21","time":{"start":1732428196147,"stop":1732428196148,"duration":1},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like mixed list\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196244,"stop":1732428196244,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6d7f7d9659ba7dd5","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"4961a0c52d810ec1","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"26cf86ca9eda4b5","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"34febd97f08d8df7","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"371c743cf6f64f1d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/37b95a78feb35857.json b/allure-report/data/test-cases/37b95a78feb35857.json deleted file mode 100644 index 7c7d402b6ff..00000000000 --- a/allure-report/data/test-cases/37b95a78feb35857.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"37b95a78feb35857","name":"Testing Warrior class >>> bruce_lee","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_bruce_lee","historyId":"7af7e9479cf2a47a636ae35231bacc9f","time":{"start":1724735127407,"stop":1724735127422,"duration":15},"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert training","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert battle","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"47eb10d648ead31b","name":"stdout","source":"47eb10d648ead31b.txt","type":"text/plain","size":67}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":12,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"72010ab4f2692ae4","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"bc3230f80ad8864d","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"37b95a78feb35857.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8d05bbd591902299.json b/allure-report/data/test-cases/37f24af32c057862.json similarity index 92% rename from allure-report/data/test-cases/8d05bbd591902299.json rename to allure-report/data/test-cases/37f24af32c057862.json index 1a8b9042acd..79c37159f34 100644 --- a/allure-report/data/test-cases/8d05bbd591902299.json +++ b/allure-report/data/test-cases/37f24af32c057862.json @@ -1 +1 @@ -{"uid":"8d05bbd591902299","name":"test_solution_empty","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_empty","historyId":"29249ea89f0081dda70899f3290f857b","time":{"start":1724733472577,"stop":1724733472577,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 86, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"8d05bbd591902299.json","parameterValues":[]} \ No newline at end of file +{"uid":"37f24af32c057862","name":"test_solution_empty","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_empty","historyId":"29249ea89f0081dda70899f3290f857b","time":{"start":1724733472577,"stop":1724733472577,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 86, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"37f24af32c057862.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/38365b0f6f350ca5.json b/allure-report/data/test-cases/38365b0f6f350ca5.json new file mode 100644 index 00000000000..399ae11c850 --- /dev/null +++ b/allure-report/data/test-cases/38365b0f6f350ca5.json @@ -0,0 +1 @@ +{"uid":"38365b0f6f350ca5","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1ff678a4c7734b0","name":"stdout","source":"1ff678a4c7734b0.txt","type":"text/plain","size":554}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"38365b0f6f350ca5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e7f4165c790464aa.json b/allure-report/data/test-cases/38b436d46d6537ee.json similarity index 61% rename from allure-report/data/test-cases/e7f4165c790464aa.json rename to allure-report/data/test-cases/38b436d46d6537ee.json index f6b439ef12b..060d186231f 100644 --- a/allure-report/data/test-cases/e7f4165c790464aa.json +++ b/allure-report/data/test-cases/38b436d46d6537ee.json @@ -1 +1 @@ -{"uid":"e7f4165c790464aa","name":"Testing period_is_late function (negative)","fullName":"kyu_8.is_your_period_late.test_is_your_period_late.PeriodIsLateTestCase#test_period_is_late_negative","historyId":"3ade0b8dc3a70452a99ea470cea361ac","time":{"start":1724733474772,"stop":1724733474772,"duration":0},"description":"\n Negative tests\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"56a8d88c2e7e082f","name":"stdout","source":"56a8d88c2e7e082f.txt","type":"text/plain","size":639}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"INTEGERS"},{"name":"feature","value":"Aggregations"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"story","value":"Sum of Intervals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1728ec761d912068","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"acc95e26a53d92ff","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}}]},"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"e03974f538ea8ee6.json","parameterValues":[]} \ No newline at end of file +{"uid":"39376204dc517df6","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8d52b389398fe1ce","name":"stdout","source":"8d52b389398fe1ce.txt","type":"text/plain","size":639}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"INTEGERS"},{"name":"feature","value":"Aggregations"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"story","value":"Sum of Intervals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"39376204dc517df6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/103efa7b767774fa.json b/allure-report/data/test-cases/39a19c10cf88efee.json similarity index 57% rename from allure-report/data/test-cases/103efa7b767774fa.json rename to allure-report/data/test-cases/39a19c10cf88efee.json index 83a565835db..0ce48bf2a99 100644 --- a/allure-report/data/test-cases/103efa7b767774fa.json +++ b/allure-report/data/test-cases/39a19c10cf88efee.json @@ -1 +1 @@ -{"uid":"103efa7b767774fa","name":"Testing first_non_repeating_letter function","fullName":"kyu_5.first_non_repeating_character.test_first_non_repeating_letter.FirstNonRepeatingLetterTestCase#test_first_non_repeating_letter","historyId":"cff7d7f7b55b35458669cd92cb129d06","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"description":"\n Testing a function named first_non_repeating_letter\n that takes a string input, and returns the first character\n that is not repeated anywhere in the string.\n\n For example, if given the input 'stress', the function\n should return 't', since the letter t only occurs once\n in the string, and occurs first in the string.\n\n As an added challenge, upper- and lowercase letters are\n considered the same character, but the function should\n return the correct case for the initial letter. For example,\n the input 'sTreSS' should return 'T'.\n\n If a string contains all repeating characters, it should\n return an empty string (\"\") or None -- see sample tests.\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"47a613697aa0c71f","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"92b17e5074e54ef7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"801bdccb4e1aa824.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"3c0afff932465669","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"3c0afff932465669.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/3c17e0f5363e3016.json b/allure-report/data/test-cases/3c17e0f5363e3016.json
new file mode 100644
index 00000000000..d6a58039119
--- /dev/null
+++ b/allure-report/data/test-cases/3c17e0f5363e3016.json
@@ -0,0 +1 @@
+{"uid":"3c17e0f5363e3016","name":"Testing 'has_subpattern' (part 1) function","fullName":"kyu_6.string_subpattern_recognition_1.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"b91c13716f440f33b1f90d86b217b534","time":{"start":1724735128930,"stop":1724735128930,"duration":0},"description":"\n String subpattern recognition I\n\n Verify that 'has_subpattern' function to returns\n either true/True or false/False if a string can be\n seen as the repetition of a simpler/shorter subpattern or not.\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"Lists"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"20308d2341c6b899.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"3c944fe792fcd179","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"Lists"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"3c944fe792fcd179.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/1b3bd0a5ea1aa072.json b/allure-report/data/test-cases/3cb4765f4f4fe8e7.json
similarity index 60%
rename from allure-report/data/test-cases/1b3bd0a5ea1aa072.json
rename to allure-report/data/test-cases/3cb4765f4f4fe8e7.json
index 9be4f3ee3f5..853bbc5d9ba 100644
--- a/allure-report/data/test-cases/1b3bd0a5ea1aa072.json
+++ b/allure-report/data/test-cases/3cb4765f4f4fe8e7.json
@@ -1 +1 @@
-{"uid":"1b3bd0a5ea1aa072","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"35b0040677726bbd","name":"stdout","source":"35b0040677726bbd.txt","type":"text/plain","size":22}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"a381266642fdbdd2","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"2030ea00b6998f67","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"1b3bd0a5ea1aa072.json","parameterValues":[]} \ No newline at end of file +{"uid":"3cb4765f4f4fe8e7","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"69b865faf74786aa","name":"stdout","source":"69b865faf74786aa.txt","type":"text/plain","size":22}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"3cb4765f4f4fe8e7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a1571db34190da47.json b/allure-report/data/test-cases/3cd6da35a1920265.json similarity index 73% rename from allure-report/data/test-cases/a1571db34190da47.json rename to allure-report/data/test-cases/3cd6da35a1920265.json index 0b54612d5e1..b2630267d02 100644 --- a/allure-report/data/test-cases/a1571db34190da47.json +++ b/allure-report/data/test-cases/3cd6da35a1920265.json @@ -1 +1 @@ -{"uid":"a1571db34190da47","name":"Wolf at the beginning of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_at_start","historyId":"dcabd02011959f0337d9098678ad990d","time":{"start":1724733474991,"stop":1724733474991,"duration":0},"description":"\n If the wolf is the closest animal to you,\n return \"Pls go away and stop eating my sheep\".\n :return:\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"292d200c224939da","name":"stdout","source":"292d200c224939da.txt","type":"text/plain","size":67}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"cabe377ec9af3c98.json","parameterValues":[]} \ No newline at end of file +{"uid":"3d13030ecd2583e8","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1dc0d1d2e3a97f3c","name":"stdout","source":"1dc0d1d2e3a97f3c.txt","type":"text/plain","size":67}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"3d13030ecd2583e8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3d4f8cb2de087cf.json b/allure-report/data/test-cases/3d4f8cb2de087cf.json new file mode 100644 index 00000000000..187578d715c --- /dev/null +++ b/allure-report/data/test-cases/3d4f8cb2de087cf.json @@ -0,0 +1 @@ +{"uid":"3d4f8cb2de087cf","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"77adc248069b48d7","name":"stdout","source":"77adc248069b48d7.txt","type":"text/plain","size":410}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"3d4f8cb2de087cf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/996165a0ada95681.json b/allure-report/data/test-cases/3d6e5f0961d8c06a.json similarity index 63% rename from allure-report/data/test-cases/996165a0ada95681.json rename to allure-report/data/test-cases/3d6e5f0961d8c06a.json index 49dd7945e72..520792833c0 100644 --- a/allure-report/data/test-cases/996165a0ada95681.json +++ b/allure-report/data/test-cases/3d6e5f0961d8c06a.json @@ -1 +1 @@ -{"uid":"996165a0ada95681","name":"Testing two_decimal_places function","fullName":"kyu_7.formatting_decimal_places_1.test_two_decimal_places.TwoDecimalPlacesTestCase#test_two_decimal_places","historyId":"27ae718be00b2e9f316c37c338cb2894","time":{"start":1724735129117,"stop":1724735129117,"duration":0},"description":"\n Testing two_decimal_places function\n with various test inputs\n\n Each floating-point number should be\n formatted that only the first two\n decimal places are returned.\n\n You don't need to check whether the input\n is a valid number because only valid numbers\n are used in the tests.\n\n Don't round the numbers! Just cut them\n after two decimal places!\n\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1732428193985,"stop":1732428193985,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"827104e07f2ca2d0","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}},{"uid":"614d8ec123787b56","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"7b2352a8e3675c67","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}},{"uid":"db7b4c897ddcf1a6","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"3e8741eae0b44214.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/14d24a2946d66b00.json b/allure-report/data/test-cases/3ec407d8e8742f0d.json similarity index 55% rename from allure-report/data/test-cases/14d24a2946d66b00.json rename to allure-report/data/test-cases/3ec407d8e8742f0d.json index 1b3f7969c12..6b3dfe50ec6 100644 --- a/allure-report/data/test-cases/14d24a2946d66b00.json +++ b/allure-report/data/test-cases/3ec407d8e8742f0d.json @@ -1 +1 @@ -{"uid":"14d24a2946d66b00","name":"Testing 'generate_hashtag' function","fullName":"kyu_5.the_hashtag_generator.test_generate_hashtag.GenerateHashtagTestCase#test_generate_hashtag","historyId":"ff2324e4a058a6c42486fd5aff532ecf","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"description":"\n Testing 'generate_hashtag' function\n ","descriptionHtml":"The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1732428195758,"stop":1732428195758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428195758,"stop":1732428195759,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1732428195762,"stop":1732428195762,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"tag","value":"Logic"},{"name":"suite","value":"Data Structures"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Algorithms"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"Strings"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a25ac6ac5e284cfbe000111","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1a1c24c0cb125454","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"7e0d94f0ee4e397d","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}},{"uid":"2d65aaadaa20d5c2","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"3ffa72675847f113.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/4045abc0bf075d90.json b/allure-report/data/test-cases/4045abc0bf075d90.json
new file mode 100644
index 00000000000..3b6069a6981
--- /dev/null
+++ b/allure-report/data/test-cases/4045abc0bf075d90.json
@@ -0,0 +1 @@
+{"uid":"4045abc0bf075d90","name":"Testing 'feast' function","fullName":"kyu_8.the_feast_of_many_beasts.test_feast.FeastTestCase#test_feast","historyId":"963bc543b4e4096b877e161985d8949c","time":{"start":1732428196409,"stop":1732428196409,"duration":0},"description":"\n Testing 'feast' function with various test inputs\n\n Testing a function feast that takes the animal's\n name and dish as arguments and returns true or\n false to indicate whether the beast is allowed\n to bring the dish to the feast.\n\n Assume that beast and dish are always lowercase strings,\n and that each has at least two letters. beast and dish\n may contain hyphens and spaces, but these will not appear\n at the beginning or end of the string. They will not\n contain numerals.\n\n There is just one rule: the dish must start and end with\n the same letters as the animal's name. For example, the\n great blue heron is bringing garlic naan and the chickadee\n is bringing chocolate cake.\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1732428194566,"stop":1732428194566,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing to_table with various test data\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1732428194569,"stop":1732428194569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7d905be84b5c0b77","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"16a9ca9919e5cef5","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"e6a3da330525d2f4","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"b78c37ec3b0f496f","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"40c938f8f83f34f7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/413fd3063d3e7dc4.json b/allure-report/data/test-cases/413fd3063d3e7dc4.json new file mode 100644 index 00000000000..ed82539be85 --- /dev/null +++ b/allure-report/data/test-cases/413fd3063d3e7dc4.json @@ -0,0 +1 @@ +{"uid":"413fd3063d3e7dc4","name":"Testing Walker class - position property from positive grids","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1732428193933,"stop":1732428193934,"duration":1},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":"Testing position property based on positive grids.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":true,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":"Testing position property based on positive grids.
","status":"passed","steps":[{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase::0","time":{"start":1732428193935,"stop":1732428193935,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"85df8de56a96ab7c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"af4da168bd187f62","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":1,"unknown":0,"total":3},"items":[{"uid":"ee4f0501c1152713","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"3edaeb1c9114b312","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"413fd3063d3e7dc4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/83105e24306c53ac.json b/allure-report/data/test-cases/416790ca79634ed0.json similarity index 57% rename from allure-report/data/test-cases/83105e24306c53ac.json rename to allure-report/data/test-cases/416790ca79634ed0.json index 2b920eb77ed..5900826d760 100644 --- a/allure-report/data/test-cases/83105e24306c53ac.json +++ b/allure-report/data/test-cases/416790ca79634ed0.json @@ -1 +1 @@ -{"uid":"83105e24306c53ac","name":"Large lists","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_large_list","historyId":"3b3f116ec3ac1abf551a51811b4a8900","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"description":"\n Large lists\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1732428195989,"stop":1732428195989,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1732428195991,"stop":1732428195991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sum of odd numbers"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"302b8c55161cc361","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}},{"uid":"8c72192846448826","status":"passed","time":{"start":1724733474460,"stop":1724733474460,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"9a325845218dd6ae","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}},{"uid":"d837297408a13c1e","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"419686fbcf063822.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/41efd0d786aed73.json b/allure-report/data/test-cases/41efd0d786aed73.json deleted file mode 100644 index 33731f93b64..00000000000 --- a/allure-report/data/test-cases/41efd0d786aed73.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"41efd0d786aed73","name":"Testing solve function","fullName":"kyu_6.casino_chips.test_solve.SolveTestCase#test_solve","historyId":"47a8a15643c132c9b9f0d902bcff28dd","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"90ef8c17370e6610","name":"stdout","source":"90ef8c17370e6610.txt","type":"text/plain","size":640}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":13,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"650faaf602cc8f99","status":"passed","time":{"start":1724733473093,"stop":1724733473093,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d1585e7c78fd8d06","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"41efd0d786aed73.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/42383b817b641e4e.json b/allure-report/data/test-cases/42383b817b641e4e.json deleted file mode 100644 index 689d097f597..00000000000 --- a/allure-report/data/test-cases/42383b817b641e4e.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"42383b817b641e4e","name":"Testing 'numericals' function","fullName":"kyu_6.numericals_of_string.test_numericals.NumericalsTestCase#test_numericals","historyId":"d2b4dccd0eb8dfd6ef62ac0349f0f6a7","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"description":"\n Testing 'numericals' function\n :return:\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string aba and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string moOse and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7bc78567c01b81e","name":"stdout","source":"7bc78567c01b81e.txt","type":"text/plain","size":401}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"428efcfcd43d2531.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/42bb8c96d4cb1bcf.json b/allure-report/data/test-cases/42bb8c96d4cb1bcf.json deleted file mode 100644 index 6742861f026..00000000000 --- a/allure-report/data/test-cases/42bb8c96d4cb1bcf.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"42bb8c96d4cb1bcf","name":"Testing alphanumeric function","fullName":"kyu_5.not_very_secure.test_alphanumeric.AlphanumericTestCase#test_alphanumeric","historyId":"e4b3b27b629bbd5f25abab144f66de37","time":{"start":1724735127860,"stop":1724735127860,"duration":0},"description":"\n Testing alphanumeric function with\n various test inputs\n\n The string has the following conditions\n to be alphanumeric only\n\n 1. At least one character (\"\" is not valid)\n 2. Allowed characters are uppercase or lowercase\n latin letters and digits from 0 to 9\n 3. No whitespaces or underscore or special chars\n\n :return: None\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"22fcf1edf8ebf197","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"620b2589fb870406","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"88c7e92ae3f035ea.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"445f2e59cb6a4191","name":"test_line_negative","fullName":"kyu_3.line_safari_is_that_a_line.test_line_negative.LineNegativeTestCase#test_line_negative","historyId":"e5c7abe0fcf3b79049d906f50808feb6","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Line Safari functionality\n Negative test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"445f2e59cb6a4191.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/44c1e35d7a7b2adb.json b/allure-report/data/test-cases/44c1e35d7a7b2adb.json
new file mode 100644
index 00000000000..3c5b25f5af4
--- /dev/null
+++ b/allure-report/data/test-cases/44c1e35d7a7b2adb.json
@@ -0,0 +1 @@
+{"uid":"44c1e35d7a7b2adb","name":"Testing gap function","fullName":"kyu_7.find_the_longest_gap.test_gap.GapTestCase#test_gap","historyId":"629f8f3c77ceed21b9aefeb6ebebc433","time":{"start":1732428195817,"stop":1732428195818,"duration":1},"description":"\n Testing gap function with various test inputs\n\n A binary gap within a positive number num is\n any sequence of consecutive zeros that is\n surrounded by ones at both ends in the binary\n representation of num.\n\n The gap function should return the length of\n its longest binary gap.\n\n The function should return 0 if num doesn't\n contain a binary gap.\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"7941ce7b9fdf9a23","name":"stdout","source":"7941ce7b9fdf9a23.txt","type":"text/plain","size":717}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":0,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a9f33e581ec48813","status":"passed","time":{"start":1724733473944,"stop":1724733473944,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"863d982a547ab48a","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"d9458c8615b9e985.json","parameterValues":[]} \ No newline at end of file +{"uid":"4544ac5de6415953","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"a3e3342383736358","name":"stdout","source":"a3e3342383736358.txt","type":"text/plain","size":717}],"parameters":[],"hasContent":true,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"4544ac5de6415953.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ef7cb2e79441187e.json b/allure-report/data/test-cases/45f16c4708137d2d.json similarity index 65% rename from allure-report/data/test-cases/ef7cb2e79441187e.json rename to allure-report/data/test-cases/45f16c4708137d2d.json index b7f7db0e0ec..023601727a6 100644 --- a/allure-report/data/test-cases/ef7cb2e79441187e.json +++ b/allure-report/data/test-cases/45f16c4708137d2d.json @@ -1 +1 @@ -{"uid":"ef7cb2e79441187e","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an un-existing item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e497f0d93067cd8e","name":"stdout","source":"e497f0d93067cd8e.txt","type":"text/plain","size":378}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"ef7cb2e79441187e.json","parameterValues":[]} \ No newline at end of file +{"uid":"45f16c4708137d2d","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an un-existing item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6ec9f0fb81f46c5f","name":"stdout","source":"6ec9f0fb81f46c5f.txt","type":"text/plain","size":378}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"45f16c4708137d2d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/461527a27e50c04a.json b/allure-report/data/test-cases/461527a27e50c04a.json new file mode 100644 index 00000000000..c4d40ba625a --- /dev/null +++ b/allure-report/data/test-cases/461527a27e50c04a.json @@ -0,0 +1 @@ +{"uid":"461527a27e50c04a","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1732428194017,"stop":1732428194017,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Snail"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ede6b0c38e1de853","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}},{"uid":"35836d979e37575","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"95ddc175910ea52","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}},{"uid":"16026a681cee6bae","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}}]},"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"461527a27e50c04a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7ac9af93b3d2f297.json b/allure-report/data/test-cases/462780a7368c9ffd.json similarity index 56% rename from allure-report/data/test-cases/7ac9af93b3d2f297.json rename to allure-report/data/test-cases/462780a7368c9ffd.json index 6b176581742..92ec3bbd124 100644 --- a/allure-report/data/test-cases/7ac9af93b3d2f297.json +++ b/allure-report/data/test-cases/462780a7368c9ffd.json @@ -1 +1 @@ -{"uid":"7ac9af93b3d2f297","name":"XOR logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_xor","historyId":"80fa996da1344642e95c3c1d2f315df1","time":{"start":1724735129586,"stop":1724735129602,"duration":16},"description":"\n Exclusive or or exclusive disjunction is a\n logical operation that outputs true only when\n inputs differ (one is true, the other is false).\n\n XOR outputs true whenever the inputs differ:\n\n Source:\n https://en.wikipedia.org/wiki/Exclusive_or\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Classes"},{"name":"story","value":"Potion Class 101"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5e4b4c0a3aeae99e","status":"passed","time":{"start":1724733474038,"stop":1724733474038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7d1621a20d6f8fe7","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"cdfe495bc85470d2.json","parameterValues":[]} \ No newline at end of file +{"uid":"47068bee5b06a234","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Classes"},{"name":"story","value":"Potion Class 101"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"47068bee5b06a234.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4750955362b24610.json b/allure-report/data/test-cases/4750955362b24610.json new file mode 100644 index 00000000000..c583eb5dcf8 --- /dev/null +++ b/allure-report/data/test-cases/4750955362b24610.json @@ -0,0 +1 @@ +{"uid":"4750955362b24610","name":"Testing share_price function","fullName":"kyu_7.share_prices.test_share_price.SharePriceTestCase#test_share_price","historyId":"884fcf3671ca321076723a238ddb92c0","time":{"start":1732428195946,"stop":1732428195947,"duration":1},"description":"\n Testing share_price function\n with multiple test inputs\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1467bda4d9665eda","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"2c2a3e42bb3933c8","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"972d0622d29729c4.json","parameterValues":[]} \ No newline at end of file +{"uid":"48abcc67292a5aa2","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"48abcc67292a5aa2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5fa0c36654622313.json b/allure-report/data/test-cases/48ff8cbb530a1868.json similarity index 73% rename from allure-report/data/test-cases/5fa0c36654622313.json rename to allure-report/data/test-cases/48ff8cbb530a1868.json index 82b5c5ae863..3c7f7e67dfe 100644 --- a/allure-report/data/test-cases/5fa0c36654622313.json +++ b/allure-report/data/test-cases/48ff8cbb530a1868.json @@ -1 +1 @@ -{"uid":"5fa0c36654622313","name":"Testing two_decimal_places function","fullName":"kyu_7.formatting_decimal_places_1.test_two_decimal_places.TwoDecimalPlacesTestCase#test_two_decimal_places","historyId":"27ae718be00b2e9f316c37c338cb2894","time":{"start":1724733474257,"stop":1724733474257,"duration":0},"description":"\n Testing two_decimal_places function\n with various test inputs\n\n Each floating-point number should be\n formatted that only the first two\n decimal places are returned.\n\n You don't need to check whether the input\n is a valid number because only valid numbers\n are used in the tests.\n\n Don't round the numbers! Just cut them\n after two decimal places!\n\n :return:\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e46ecdc21febfa2d","name":"stdout","source":"e46ecdc21febfa2d.txt","type":"text/plain","size":3898}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b99ca9a8ecf19524","status":"passed","time":{"start":1724733472296,"stop":1724733472296,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"36b9e5073b489f49","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}}]},"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"5dad026541a05e65.json","parameterValues":[]} \ No newline at end of file +{"uid":"49355004a4136993","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e160bbe65fc37bcd","name":"stdout","source":"e160bbe65fc37bcd.txt","type":"text/plain","size":3898}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"49355004a4136993.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4942ac4be65ef1b0.json b/allure-report/data/test-cases/4942ac4be65ef1b0.json new file mode 100644 index 00000000000..e2e848b7755 --- /dev/null +++ b/allure-report/data/test-cases/4942ac4be65ef1b0.json @@ -0,0 +1 @@ +{"uid":"4942ac4be65ef1b0","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1732428193998,"stop":1732428193998,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Permutations"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f12b5c3f29ddd74a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"ef2d26c76c436892","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"1319e1ae94efdc02","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"6fbcaa806475fb37","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"4942ac4be65ef1b0.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/d5eb9c17e95fe424.json b/allure-report/data/test-cases/4961a0c52d810ec1.json
similarity index 79%
rename from allure-report/data/test-cases/d5eb9c17e95fe424.json
rename to allure-report/data/test-cases/4961a0c52d810ec1.json
index 587351ef1f6..b7c6d3cb366 100644
--- a/allure-report/data/test-cases/d5eb9c17e95fe424.json
+++ b/allure-report/data/test-cases/4961a0c52d810ec1.json
@@ -1 +1 @@
-{"uid":"d5eb9c17e95fe424","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_2","historyId":"72a2d75b45f09e520765f369cfc2bc8f","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"d5eb9c17e95fe424.json","parameterValues":[]} \ No newline at end of file +{"uid":"4961a0c52d810ec1","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_2","historyId":"72a2d75b45f09e520765f369cfc2bc8f","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"4961a0c52d810ec1.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/aacbcab78401e86c.json b/allure-report/data/test-cases/49fb68289fb078f8.json similarity index 71% rename from allure-report/data/test-cases/aacbcab78401e86c.json rename to allure-report/data/test-cases/49fb68289fb078f8.json index 50d26ab8b14..93c51e6b74f 100644 --- a/allure-report/data/test-cases/aacbcab78401e86c.json +++ b/allure-report/data/test-cases/49fb68289fb078f8.json @@ -1 +1 @@ -{"uid":"aacbcab78401e86c","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1724733472452,"stop":1724733472499,"duration":47},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2c0b65a9daada0df","name":"stdout","source":"2c0b65a9daada0df.txt","type":"text/plain","size":1579}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"aacbcab78401e86c.json","parameterValues":[]} \ No newline at end of file +{"uid":"49fb68289fb078f8","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1724733472452,"stop":1724733472499,"duration":47},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"aef94a39bd8b19be","name":"stdout","source":"aef94a39bd8b19be.txt","type":"text/plain","size":1579}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"49fb68289fb078f8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4a35a10fb92b5fdb.json b/allure-report/data/test-cases/4a35a10fb92b5fdb.json new file mode 100644 index 00000000000..a68ef6b638f --- /dev/null +++ b/allure-report/data/test-cases/4a35a10fb92b5fdb.json @@ -0,0 +1 @@ +{"uid":"4a35a10fb92b5fdb","name":"Testing largestPower function","fullName":"kyu_7.powers_of_3.test_largest_power.LargestPowerTestCase#test_largest_power","historyId":"026739760bca73e921f8e5d35d9329cf","time":{"start":1724735129196,"stop":1724735129196,"duration":0},"description":"\n Testing largestPower function\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1732428194034,"stop":1732428194034,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Strip Comments"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"863d9e582b6f3de4","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}},{"uid":"102a91ff9d2e2c1f","status":"passed","time":{"start":1724733472421,"stop":1724733472437,"duration":16}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"f711bbcd16ab2119","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}},{"uid":"5c64823a2a73f974","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"4b8219eb37520d2d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4b8d012f19a4e1e6.json b/allure-report/data/test-cases/4b8d012f19a4e1e6.json new file mode 100644 index 00000000000..6525c429461 --- /dev/null +++ b/allure-report/data/test-cases/4b8d012f19a4e1e6.json @@ -0,0 +1 @@ +{"uid":"4b8d012f19a4e1e6","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1724733473171,"stop":1724733473186,"duration":15},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Remove items from the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f66e1341a4df20a3","name":"stdout","source":"f66e1341a4df20a3.txt","type":"text/plain","size":254}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"4b8d012f19a4e1e6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e6d62aae7d602336.json b/allure-report/data/test-cases/4bb422e9ca9901c8.json similarity index 59% rename from allure-report/data/test-cases/e6d62aae7d602336.json rename to allure-report/data/test-cases/4bb422e9ca9901c8.json index d62a62d3879..e548562848e 100644 --- a/allure-report/data/test-cases/e6d62aae7d602336.json +++ b/allure-report/data/test-cases/4bb422e9ca9901c8.json @@ -1 +1 @@ -{"uid":"e6d62aae7d602336","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_test","historyId":"eb0582ce0674121869dd4f6fce46e7f3","time":{"start":1724735129367,"stop":1724735129367,"duration":0},"description":"\n 3 is not a square number\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1732428196495,"stop":1732428196495,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1732428196503,"stop":1732428196503,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1732428196505,"stop":1732428196505,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"99ca7a938f9d4989","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}},{"uid":"2980fd5af6447b30","status":"passed","time":{"start":1724733475038,"stop":1724733475038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"35cf25b9e515e00d","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}},{"uid":"928532982127bba0","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"4c77d97bc41048ff.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2348115dae27ed81.json b/allure-report/data/test-cases/4c7e13d0f61cf99a.json similarity index 71% rename from allure-report/data/test-cases/2348115dae27ed81.json rename to allure-report/data/test-cases/4c7e13d0f61cf99a.json index 62b34295e68..84e0dfe873b 100644 --- a/allure-report/data/test-cases/2348115dae27ed81.json +++ b/allure-report/data/test-cases/4c7e13d0f61cf99a.json @@ -1 +1 @@ -{"uid":"2348115dae27ed81","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"cf2100e65e09b423","name":"stdout","source":"cf2100e65e09b423.txt","type":"text/plain","size":908}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":14,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"FEATURES"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"PROGRAMMING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LANGUAGE","DECLARATIVE","REGULAR","EXPRESSIONS","FUNDAMENTALS","PROGRAMMING","FEATURES","ADVANCED"]},"source":"2348115dae27ed81.json","parameterValues":[]} \ No newline at end of file +{"uid":"4c7e13d0f61cf99a","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"df1294dda064bff1","name":"stdout","source":"df1294dda064bff1.txt","type":"text/plain","size":908}],"parameters":[],"hasContent":true,"stepsCount":14,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"FEATURES"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"PROGRAMMING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LANGUAGE","DECLARATIVE","REGULAR","EXPRESSIONS","FUNDAMENTALS","PROGRAMMING","FEATURES","ADVANCED"]},"source":"4c7e13d0f61cf99a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/64a44b1c9018ad85.json b/allure-report/data/test-cases/4dc4de0a74fe7f66.json similarity index 54% rename from allure-report/data/test-cases/64a44b1c9018ad85.json rename to allure-report/data/test-cases/4dc4de0a74fe7f66.json index 036775b770f..432eef84661 100644 --- a/allure-report/data/test-cases/64a44b1c9018ad85.json +++ b/allure-report/data/test-cases/4dc4de0a74fe7f66.json @@ -1 +1 @@ -{"uid":"64a44b1c9018ad85","name":"Testing period_is_late function (positive)","fullName":"kyu_8.is_your_period_late.test_is_your_period_late.PeriodIsLateTestCase#test_period_is_late_positive","historyId":"763475007d09f077c2c251a191291e14","time":{"start":1724735129555,"stop":1724735129555,"duration":0},"description":"\n Positive tests\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c9a3c6ad41839ce3","name":"stdout","source":"c9a3c6ad41839ce3.txt","type":"text/plain","size":502}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6fce95111dc1cc14","status":"passed","time":{"start":1724733473061,"stop":1724733473061,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"f52a489cb0add672","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"dc29e000a4adcd25.json","parameterValues":[]} \ No newline at end of file +{"uid":"4ea31191e1f5ab3b","name":"Testing array_diff function","fullName":"kyu_6.array_diff.test_array_diff.ArrayDiffTestCase#test_array_diff_function","historyId":"5e365f66b39a2fede4fe18a5cc569699","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3f3d8444cfb8c128","name":"stdout","source":"3f3d8444cfb8c128.txt","type":"text/plain","size":502}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"4ea31191e1f5ab3b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4ecd1e835300dbcf.json b/allure-report/data/test-cases/4ecd1e835300dbcf.json deleted file mode 100644 index 212527de533..00000000000 --- a/allure-report/data/test-cases/4ecd1e835300dbcf.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"4ecd1e835300dbcf","name":"powers function should return an array of unique numbers","fullName":"kyu_7.sum_of_powers_of_2.test_sum_of_powers_of_2.SumOfPowerOfTwoTestCase#test_powers","historyId":"489e3070dc83756c411301400dd6e3c8","time":{"start":1724735129289,"stop":1724735129289,"duration":0},"description":"\n The function powers takes a single parameter,\n the number n, and should return an array of unique numbers.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9252a83ce892d840","name":"stdout","source":"9252a83ce892d840.txt","type":"text/plain","size":1536}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"4f1172fa5620cc18.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4f85a4b1698202d.json b/allure-report/data/test-cases/4f85a4b1698202d.json deleted file mode 100644 index 7eb911cb98d..00000000000 --- a/allure-report/data/test-cases/4f85a4b1698202d.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"4f85a4b1698202d","name":"Testing anagrams function","fullName":"kyu_5.where_my_anagrams_at.test_anagrams.AnagramsTestCase#test_anagrams","historyId":"c060fb3e36725c887b4b4edce83f7142","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"description":"\n Test a function that will find all the anagrams of a word from a list.\n You will be given two inputs a word and an array with words. You should\n return an array of all the anagrams or an empty array if there are none.\n\n For example:\n\n anagrams('abba', ['aabb', 'abcd', 'bbaa', 'dada']) => ['aabb', 'bbaa']\n anagrams('racer', ['crazer', 'carer', 'racar', 'caers', 'racer']) => ['carer', 'racer']\n anagrams('laser', ['lazing', 'lazy', 'lacer']) => []\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"ea7fb2d8338c4ae8","name":"stdout","source":"ea7fb2d8338c4ae8.txt","type":"text/plain","size":949}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9d8518015a2b07b6","status":"passed","time":{"start":1724733472437,"stop":1724733472437,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"af3c309699fc2b8b","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}}]},"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"d6e4ebd44034ff08.json","parameterValues":[]} \ No newline at end of file +{"uid":"5319ceacad5a43bc","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"be7449bab7c02e56","name":"stdout","source":"be7449bab7c02e56.txt","type":"text/plain","size":949}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"5319ceacad5a43bc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5320007ca0191a21.json b/allure-report/data/test-cases/5320007ca0191a21.json deleted file mode 100644 index 8b6d39775de..00000000000 --- a/allure-report/data/test-cases/5320007ca0191a21.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"5320007ca0191a21","name":"Testing password function","fullName":"kyu_7.password_validator.test_password.PasswordTestCase#test_password","historyId":"aaef6593296fd19246b6caa71f38ecab","time":{"start":1724733474335,"stop":1724733474335,"duration":0},"description":"\n Testing password function with various test inputs\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6062d7cf7b32bc2c","name":"stdout","source":"6062d7cf7b32bc2c.txt","type":"text/plain","size":676}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LOOPS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"252f381a068f762f.json","parameterValues":[]} \ No newline at end of file +{"uid":"54043a9fba80789b","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3a4387d961fd6fe2","name":"stdout","source":"3a4387d961fd6fe2.txt","type":"text/plain","size":676}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LOOPS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"54043a9fba80789b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/54bb63fb3736b8ae.json b/allure-report/data/test-cases/54bb63fb3736b8ae.json new file mode 100644 index 00000000000..5731850b6ea --- /dev/null +++ b/allure-report/data/test-cases/54bb63fb3736b8ae.json @@ -0,0 +1 @@ +{"uid":"54bb63fb3736b8ae","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1732428196491,"stop":1732428196491,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"c8c44a676a12b5c6","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"e427c3eece0f34c3","status":"passed","time":{"start":1724733475007,"stop":1724733475007,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"b97e3a9bf54f17f3","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"73d92f8f0c07772d","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"54bb63fb3736b8ae.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/761811e55728ed74.json b/allure-report/data/test-cases/54e4671ce8499dcf.json similarity index 64% rename from allure-report/data/test-cases/761811e55728ed74.json rename to allure-report/data/test-cases/54e4671ce8499dcf.json index 0abb38cb145..455ee254306 100644 --- a/allure-report/data/test-cases/761811e55728ed74.json +++ b/allure-report/data/test-cases/54e4671ce8499dcf.json @@ -1 +1 @@ -{"uid":"761811e55728ed74","name":"Testing Encoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding.EncodingTestCase#test_encoding","historyId":"195b2d3cd638502ec301b9e9eaa3f969","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"336614ff4bde976d","name":"stdout","source":"336614ff4bde976d.txt","type":"text/plain","size":878}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"761811e55728ed74.json","parameterValues":[]} \ No newline at end of file +{"uid":"54e4671ce8499dcf","name":"Testing Encoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding.EncodingTestCase#test_encoding","historyId":"195b2d3cd638502ec301b9e9eaa3f969","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6f4b7e883a26cafe","name":"stdout","source":"6f4b7e883a26cafe.txt","type":"text/plain","size":878}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"54e4671ce8499dcf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/51a9aec46de8d878.json b/allure-report/data/test-cases/5519a1e9b61f2ca3.json similarity index 55% rename from allure-report/data/test-cases/51a9aec46de8d878.json rename to allure-report/data/test-cases/5519a1e9b61f2ca3.json index 11399b7df03..3a07e1badec 100644 --- a/allure-report/data/test-cases/51a9aec46de8d878.json +++ b/allure-report/data/test-cases/5519a1e9b61f2ca3.json @@ -1 +1 @@ -{"uid":"51a9aec46de8d878","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1724735128063,"stop":1724735128078,"duration":15},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Remove items from the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c3d16eb9cb3b239c","name":"stdout","source":"c3d16eb9cb3b239c.txt","type":"text/plain","size":254}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a4b7cb6ba7726224","status":"passed","time":{"start":1724733473171,"stop":1724733473186,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"43c0068fe0a1265e","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"51a9aec46de8d878.json","parameterValues":[]} \ No newline at end of file +{"uid":"5519a1e9b61f2ca3","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1724735128063,"stop":1724735128078,"duration":15},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Remove items from the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a66ea3c1c7d07513","name":"stdout","source":"a66ea3c1c7d07513.txt","type":"text/plain","size":254}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"5519a1e9b61f2ca3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/650faaf602cc8f99.json b/allure-report/data/test-cases/552742d77daecee9.json similarity index 59% rename from allure-report/data/test-cases/650faaf602cc8f99.json rename to allure-report/data/test-cases/552742d77daecee9.json index 6e0f0a2e4d1..596a4982bc5 100644 --- a/allure-report/data/test-cases/650faaf602cc8f99.json +++ b/allure-report/data/test-cases/552742d77daecee9.json @@ -1 +1 @@ -{"uid":"650faaf602cc8f99","name":"Testing solve function","fullName":"kyu_6.casino_chips.test_solve.SolveTestCase#test_solve","historyId":"47a8a15643c132c9b9f0d902bcff28dd","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fcab257bac252f0f","name":"stdout","source":"fcab257bac252f0f.txt","type":"text/plain","size":640}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":13,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Casino chips"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"650faaf602cc8f99.json","parameterValues":[]} \ No newline at end of file +{"uid":"552742d77daecee9","name":"Testing solve function","fullName":"kyu_6.casino_chips.test_solve.SolveTestCase#test_solve","historyId":"47a8a15643c132c9b9f0d902bcff28dd","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"efae8b9f43d09441","name":"stdout","source":"efae8b9f43d09441.txt","type":"text/plain","size":640}],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Casino chips"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"552742d77daecee9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/84fd4c67efee5295.json b/allure-report/data/test-cases/55e4a84277d15d0d.json similarity index 68% rename from allure-report/data/test-cases/84fd4c67efee5295.json rename to allure-report/data/test-cases/55e4a84277d15d0d.json index b9acdc4da4d..e8e0118a880 100644 --- a/allure-report/data/test-cases/84fd4c67efee5295.json +++ b/allure-report/data/test-cases/55e4a84277d15d0d.json @@ -1 +1 @@ -{"uid":"84fd4c67efee5295","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724735127828,"stop":1724735127828,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"bc5cb7d257f882a1","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472921,"stop":1724733472921,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"62bf772c3a2aa5d2","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}}]},"tags":["MATHEMATICS","NUMBERS","LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"84fd4c67efee5295.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"55e4a84277d15d0d","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724735127828,"stop":1724735127828,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"55e4a84277d15d0d.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/d6e6e46de805754f.json b/allure-report/data/test-cases/566a56003ac2e703.json
similarity index 57%
rename from allure-report/data/test-cases/d6e6e46de805754f.json
rename to allure-report/data/test-cases/566a56003ac2e703.json
index 4f284f9e81e..6a1d00e00f5 100644
--- a/allure-report/data/test-cases/d6e6e46de805754f.json
+++ b/allure-report/data/test-cases/566a56003ac2e703.json
@@ -1 +1 @@
-{"uid":"d6e6e46de805754f","name":"Non consecutive number should be returned","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_positive","historyId":"13df60cbdff5ee076adcd6328cc69159","time":{"start":1724735129461,"stop":1724735129461,"duration":0},"description":"\n If we have an array [1,2,3,4,6,7,8] then 1 then 2\n then 3 then 4 are all consecutive but 6 is not,\n so that's the first non-consecutive number.\n :return:\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4e5a0ef8eae5b1f5","name":"stdout","source":"4e5a0ef8eae5b1f5.txt","type":"text/plain","size":3898}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAME BOARDS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"b99ca9a8ecf19524.json","parameterValues":[]} \ No newline at end of file +{"uid":"56ae9013352b7649","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"dd695e9095070885","name":"stdout","source":"dd695e9095070885.txt","type":"text/plain","size":3898}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAME BOARDS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"56ae9013352b7649.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/56cce31bdf350ac7.json b/allure-report/data/test-cases/56cce31bdf350ac7.json new file mode 100644 index 00000000000..40903401d89 --- /dev/null +++ b/allure-report/data/test-cases/56cce31bdf350ac7.json @@ -0,0 +1 @@ +{"uid":"56cce31bdf350ac7","name":"Testing 'save' function: negative","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_negative","historyId":"eb89ee17d2b7a29796b27ce5ba503de6","time":{"start":1732428195803,"stop":1732428195803,"duration":0},"description":"\n Testing 'save' function: negative\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1732428194708,"stop":1732428194708,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1732428195425,"stop":1732428195425,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1732428195438,"stop":1732428195438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Diagonal"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b1f2cc8e1be032d","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}},{"uid":"6113acbf67a69117","status":"passed","time":{"start":1724733473218,"stop":1724733473889,"duration":671}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"964ad50f448ed64d","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}},{"uid":"7f2ec06c200d3086","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"56da494ae1701253.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/571176bf000b455b.json b/allure-report/data/test-cases/571176bf000b455b.json new file mode 100644 index 00000000000..2bd37daa87f --- /dev/null +++ b/allure-report/data/test-cases/571176bf000b455b.json @@ -0,0 +1 @@ +{"uid":"571176bf000b455b","name":"test_solution_medium","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_medium","historyId":"7ee6731933bd9dff6fabc41830db1bf0","time":{"start":1732428194198,"stop":1732428194198,"duration":0},"description":"\n Testing using medium test data\n :return:\n ","descriptionHtml":" Testing using medium test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 46, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2f520e29faf9fa03","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"4073719ea3c0e8fe","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"87acfa055dcbe26a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"a064a48d91c28f13","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"571176bf000b455b.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/5740cd94d023a2bf.json b/allure-report/data/test-cases/5740cd94d023a2bf.json
deleted file mode 100644
index b484ec71bb7..00000000000
--- a/allure-report/data/test-cases/5740cd94d023a2bf.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"5740cd94d023a2bf","name":"Testing duplicate_encode function","fullName":"kyu_6.duplicate_encoder.test_duplicate_encode.DuplicateEncodeTestCase#test_duplicate_encode","historyId":"fa07af113ba280dc5a89690a520b3897","time":{"start":1724733473202,"stop":1724733473202,"duration":0},"description":"\n Testing duplicate_encode function\n with various test inputs\n :return:\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"18b79283e1874d20","name":"stdout","source":"18b79283e1874d20.txt","type":"text/plain","size":1904}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":21,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"PARSING STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"a90fdb1fb3683308.json","parameterValues":[]} \ No newline at end of file +{"uid":"57e5e5f4d9d91cf6","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5c2711b7e4875740","name":"stdout","source":"5c2711b7e4875740.txt","type":"text/plain","size":1904}],"parameters":[],"hasContent":true,"stepsCount":21,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"PARSING STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"57e5e5f4d9d91cf6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e722b9059cce92a0.json b/allure-report/data/test-cases/580b983b7062983c.json similarity index 68% rename from allure-report/data/test-cases/e722b9059cce92a0.json rename to allure-report/data/test-cases/580b983b7062983c.json index e202e4ea547..35920369148 100644 --- a/allure-report/data/test-cases/e722b9059cce92a0.json +++ b/allure-report/data/test-cases/580b983b7062983c.json @@ -1 +1 @@ -{"uid":"e722b9059cce92a0","name":"Test with empty string","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_empty","historyId":"2af6aa545c98eb65f8404392b6468813","time":{"start":1724733474882,"stop":1724733474882,"duration":0},"description":"\n Test with empty string\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"79650f7b74d71675","name":"stdout","source":"79650f7b74d71675.txt","type":"text/plain","size":46002}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ce00ffd36d904f61","status":"passed","time":{"start":1724733472624,"stop":1724733472765,"duration":141}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"2ed8dfd7ca5a3d13","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}}]},"tags":["ALGORITHMS"]},"source":"9cb8749ab5d5d5c7.json","parameterValues":[]} \ No newline at end of file +{"uid":"58e0261647deccd2","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c0c4047155365dbf","name":"stdout","source":"c0c4047155365dbf.txt","type":"text/plain","size":46002}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"58e0261647deccd2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/776765eba79884f4.json b/allure-report/data/test-cases/59120ba12cafb7e8.json similarity index 72% rename from allure-report/data/test-cases/776765eba79884f4.json rename to allure-report/data/test-cases/59120ba12cafb7e8.json index 55773dd3ce0..12c7ce5421f 100644 --- a/allure-report/data/test-cases/776765eba79884f4.json +++ b/allure-report/data/test-cases/59120ba12cafb7e8.json @@ -1 +1 @@ -{"uid":"776765eba79884f4","name":"Testing 'solution' function","fullName":"kyu_7.substituting_variables_into_strings_padded_numbers.test_solution.SolutionTestCase#test_solution","historyId":"fbdd2daae3e9a5e6dd05fcb0403a88d1","time":{"start":1724733474444,"stop":1724733474444,"duration":0},"description":"\n Testing 'solution' function.\n\n The should return a formatted string.\n The return value should equal \"Value is VALUE\"\n where value is a 5 digit padded number.\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy line function exception\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1732428195787,"stop":1732428195788,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2dc119e05306bc09","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"d936198953d58b58","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"df0c490941a6877a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"c7106989a12e3c0a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"593778a5ba99d447.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/693c5b2693478689.json b/allure-report/data/test-cases/5961f436380e11d2.json similarity index 57% rename from allure-report/data/test-cases/693c5b2693478689.json rename to allure-report/data/test-cases/5961f436380e11d2.json index 3ede8076832..2628c73b9cf 100644 --- a/allure-report/data/test-cases/693c5b2693478689.json +++ b/allure-report/data/test-cases/5961f436380e11d2.json @@ -1 +1 @@ -{"uid":"693c5b2693478689","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1724735127122,"stop":1724735127141,"duration":19},"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7517e0fe4fd38ce3","name":"stdout","source":"7517e0fe4fd38ce3.txt","type":"text/plain","size":1904}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":21,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"2 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a90fdb1fb3683308","status":"passed","time":{"start":1724733472280,"stop":1724733472280,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d6d06cbc227917e","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}}]},"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"693c5b2693478689.json","parameterValues":[]} \ No newline at end of file +{"uid":"5961f436380e11d2","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1724735127122,"stop":1724735127141,"duration":19},"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f509afa4d498e7c1","name":"stdout","source":"f509afa4d498e7c1.txt","type":"text/plain","size":1904}],"parameters":[],"hasContent":true,"stepsCount":21,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"2 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"5961f436380e11d2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2acb560e089cb7c8.json b/allure-report/data/test-cases/5998f9acb6d6dab8.json similarity index 57% rename from allure-report/data/test-cases/2acb560e089cb7c8.json rename to allure-report/data/test-cases/5998f9acb6d6dab8.json index 6749e4af168..19b9bd1aedf 100644 --- a/allure-report/data/test-cases/2acb560e089cb7c8.json +++ b/allure-report/data/test-cases/5998f9acb6d6dab8.json @@ -1 +1 @@ -{"uid":"2acb560e089cb7c8","name":"Test with one char only","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_one_char","historyId":"e3d629a995491cb3a3079998a04583ff","time":{"start":1724735129649,"stop":1724735129649,"duration":0},"description":"\n Test with one char only\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing odd_row function with various test data\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1732428195618,"stop":1732428195618,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Row of the odd triangle"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"tag","value":"PERFORMANCE"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e378762a5dac9d1e","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}},{"uid":"2e9a9a4090c00445","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"9b82a842fdc9b867","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}},{"uid":"4c3877c30e625752","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}}]},"tags":["PERFORMANCE","ALGORITHMS"]},"source":"59b1922c33f3ac65.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9393151991be7f33.json b/allure-report/data/test-cases/59e6c1fe5b50c363.json similarity index 57% rename from allure-report/data/test-cases/9393151991be7f33.json rename to allure-report/data/test-cases/59e6c1fe5b50c363.json index 96127017c18..869ac3e8bd1 100644 --- a/allure-report/data/test-cases/9393151991be7f33.json +++ b/allure-report/data/test-cases/59e6c1fe5b50c363.json @@ -1 +1 @@ -{"uid":"9393151991be7f33","name":"Testing 'sum_triangular_numbers' with negative numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_negative_numbers","historyId":"4e553d5e3ff5fc5c21a746a843af96e5","time":{"start":1724735129305,"stop":1724735129305,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with negative numbers\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d789b0e2f7ac3471","name":"stdout","source":"d789b0e2f7ac3471.txt","type":"text/plain","size":167}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"91e2410535ccc997","status":"passed","time":{"start":1724733474163,"stop":1724733474163,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7f4f9e94ec6d4f1e","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"490cf50ddd5cff83.json","parameterValues":[]} \ No newline at end of file +{"uid":"5a497340f38e6588","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724735129008,"stop":1724735129024,"duration":16},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f1a162618bd1b29d","name":"stdout","source":"f1a162618bd1b29d.txt","type":"text/plain","size":167}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"5a497340f38e6588.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5af3f258cf327b2a.json b/allure-report/data/test-cases/5af3f258cf327b2a.json new file mode 100644 index 00000000000..5dfdc8fcd42 --- /dev/null +++ b/allure-report/data/test-cases/5af3f258cf327b2a.json @@ -0,0 +1 @@ +{"uid":"5af3f258cf327b2a","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[{"name":"Assert that classes Bob and Bob have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes Dog and Dog have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes 5 and 5 have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes good and good have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes 50lb and 50lb have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes brown and brown have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1732428195883,"stop":1732428195883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"GAMES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d12fb82b623fefb9","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}},{"uid":"c6923016c0d7805e","status":"passed","time":{"start":1724733474319,"stop":1724733474319,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"dead64fe3d4f484d","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}},{"uid":"91ff78dc5a767b91","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","GAMES","ALGORITHMS"]},"source":"5af3f258cf327b2a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/614b9e2de4457676.json b/allure-report/data/test-cases/5b153d545c48d264.json similarity index 61% rename from allure-report/data/test-cases/614b9e2de4457676.json rename to allure-report/data/test-cases/5b153d545c48d264.json index 7b08b893812..dd2cccae088 100644 --- a/allure-report/data/test-cases/614b9e2de4457676.json +++ b/allure-report/data/test-cases/5b153d545c48d264.json @@ -1 +1 @@ -{"uid":"614b9e2de4457676","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a5a1e9dabd89620f","name":"stdout","source":"a5a1e9dabd89620f.txt","type":"text/plain","size":326}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8f884e4fa29bb7d4","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"e798d2f5cc38e024","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"614b9e2de4457676.json","parameterValues":[]} \ No newline at end of file +{"uid":"5b153d545c48d264","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5ab43402bfd67bde","name":"stdout","source":"5ab43402bfd67bde.txt","type":"text/plain","size":326}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"5b153d545c48d264.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5b15d7c039eaff13.json b/allure-report/data/test-cases/5b15d7c039eaff13.json new file mode 100644 index 00000000000..0e614b2a958 --- /dev/null +++ b/allure-report/data/test-cases/5b15d7c039eaff13.json @@ -0,0 +1 @@ +{"uid":"5b15d7c039eaff13","name":"Testing set_alarm function","fullName":"kyu_8.set_alarm.test_set_alarm.SetAlarmTestCase#test_set_alarm","historyId":"77c7125894dc4635fdd1db51405959d3","time":{"start":1732428196377,"stop":1732428196377,"duration":0},"description":"\n Testing set_alarm function with various test inputs.\n\n The function should return true if you are employed\n and not on vacation (because these are the circumstances\n under which you need to set an alarm). It should return\n false otherwise.\n\n Examples:\n\n setAlarm(true, true) -> false\n setAlarm(false, true) -> false\n setAlarm(false, false) -> false\n setAlarm(true, false) -> true\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"1467bda4d9665eda.json","parameterValues":[]} \ No newline at end of file +{"uid":"5b3fc84157197066","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"5b3fc84157197066.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d880bf6ff390f682.json b/allure-report/data/test-cases/5b88f232b1f58c27.json similarity index 76% rename from allure-report/data/test-cases/d880bf6ff390f682.json rename to allure-report/data/test-cases/5b88f232b1f58c27.json index e2dab6e958d..fd9a4aa39b9 100644 --- a/allure-report/data/test-cases/d880bf6ff390f682.json +++ b/allure-report/data/test-cases/5b88f232b1f58c27.json @@ -1 +1 @@ -{"uid":"d880bf6ff390f682","name":"Testing tickets function","fullName":"kyu_6.vasya_clerk.test_tickets.TicketsTestCase#test_tickets","historyId":"bb3964d396ef802dceada9777cff8e45","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"description":"\n Testing tickets function with various test inputs.\n\n The new \"Avengers\" movie has just been released!\n There are a lot of people at the cinema box office\n standing in a huge line. Each of them has a single\n 100, 50 or 25 dollar bill. An \"Avengers\" ticket\n costs 25 dollars.\n\n Vasya is currently working as a clerk.\n He wants to sell a ticket to every single person\n in this line.\n\n Can Vasya sell a ticket to every person and give change\n if he initially has no money and sells the tickets strictly\n in the order people queue?\n\n The function should return YES, if Vasya can sell\n a ticket to every person and give change with the\n bills he has at hand at that moment. Otherwise return NO.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428194233,"stop":1732428194233,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8dcfddf689f44d1d","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"b080152571ac4adf","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"645c6c05562d2f01","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"34569132e9551c33","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"5cd4eeb8a4b79d6b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5ce6881896e2614d.json b/allure-report/data/test-cases/5ce6881896e2614d.json new file mode 100644 index 00000000000..e83e72e1320 --- /dev/null +++ b/allure-report/data/test-cases/5ce6881896e2614d.json @@ -0,0 +1 @@ +{"uid":"5ce6881896e2614d","name":"Testing password function","fullName":"kyu_7.password_validator.test_password.PasswordTestCase#test_password","historyId":"aaef6593296fd19246b6caa71f38ecab","time":{"start":1732428195897,"stop":1732428195897,"duration":0},"description":"\n Testing password function with various test inputs\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":14,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1732428194165,"stop":1732428194165,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"LANGUAGE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"feature","value":"String"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FEATURES"},{"name":"tag","value":"PROGRAMMING"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"13ca3a7cd8b0e3af","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}},{"uid":"4c7e13d0f61cf99a","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"ace382695affabdf","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}},{"uid":"aca9d99cb0e5842e","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}}]},"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","FUNDAMENTALS","PROGRAMMING","ADVANCED","FEATURES"]},"source":"5d8c14adba840438.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6c1504a4fcfadf69.json b/allure-report/data/test-cases/5ea1e8d078b774a7.json similarity index 57% rename from allure-report/data/test-cases/6c1504a4fcfadf69.json rename to allure-report/data/test-cases/5ea1e8d078b774a7.json index 5ff6e1feeea..233ead5efcc 100644 --- a/allure-report/data/test-cases/6c1504a4fcfadf69.json +++ b/allure-report/data/test-cases/5ea1e8d078b774a7.json @@ -1 +1 @@ -{"uid":"6c1504a4fcfadf69","name":"test_random","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_random","historyId":"f9568f445cf6471d62f38f61a6e1887d","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"description":"\n Advanced/random test case\n :return:\n ","descriptionHtml":" Advanced/random test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Advanced/random test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f26281521e32f10c","name":"stdout","source":"f26281521e32f10c.txt","type":"text/plain","size":791}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"a83637127d81f7d9","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"6c1504a4fcfadf69.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"5ea1e8d078b774a7","name":"test_random","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_random","historyId":"f9568f445cf6471d62f38f61a6e1887d","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"description":"\n Advanced/random test case\n :return:\n ","descriptionHtml":" Advanced/random test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Advanced/random test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3326f8b00659b17c","name":"stdout","source":"3326f8b00659b17c.txt","type":"text/plain","size":791}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"6c1504a4fcfadf69","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}},{"uid":"a83637127d81f7d9","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"5ea1e8d078b774a7.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/5ea5418b10cdf416.json b/allure-report/data/test-cases/5ea5418b10cdf416.json
new file mode 100644
index 00000000000..20df6bb3235
--- /dev/null
+++ b/allure-report/data/test-cases/5ea5418b10cdf416.json
@@ -0,0 +1 @@
+{"uid":"5ea5418b10cdf416","name":"Testing dir_reduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"description":"\n Test a function dir_reduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1732428194205,"stop":1732428194205,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function dir_reduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['NORTH', 'SOUTH', 'SOUTH', 'EAST', 'WEST', 'NORTH', 'WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'EAST', 'NORTH', 'EAST', 'WEST', 'WEST', 'EAST', 'EAST', 'WEST', 'SOUTH']) and verify the output (['NORTH', 'EAST']) vs expected (['NORTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['EAST', 'NORTH', 'SOUTH', 'NORTH', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'NORTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'SOUTH', 'NORTH', 'NORTH', 'SOUTH', 'WEST', 'NORTH', 'EAST', 'WEST', 'WEST', 'WEST', 'EAST', 'SOUTH', 'SOUTH']) and verify the output (['EAST', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'WEST', 'NORTH', 'WEST', 'SOUTH', 'SOUTH']) vs expected (['EAST', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'WEST', 'NORTH', 'WEST', 'SOUTH', 'SOUTH'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['WEST', 'NORTH', 'EAST', 'EAST', 'EAST', 'EAST', 'WEST', 'WEST', 'WEST', 'WEST', 'NORTH', 'NORTH', 'SOUTH', 'EAST']) and verify the output (['WEST', 'NORTH', 'NORTH', 'EAST']) vs expected (['WEST', 'NORTH', 'NORTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1732428194209,"stop":1732428194209,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Directions Reduction"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"15dbab6d625f40d3","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"8cdb3386cf094e1f","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"5e6aa533c6c0fafa","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"d65c16a1b47d468e","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"5ea5418b10cdf416.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5eca272b3b393557.json b/allure-report/data/test-cases/5eca272b3b393557.json new file mode 100644 index 00000000000..49cbd08bc0c --- /dev/null +++ b/allure-report/data/test-cases/5eca272b3b393557.json @@ -0,0 +1 @@ +{"uid":"5eca272b3b393557","name":"Testing next_smaller function","fullName":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller.NextSmallerTestCase#test_next_smaller","historyId":"9d8cb8adf1764c55348d349698b938ac","time":{"start":1732428193992,"stop":1732428193993,"duration":1},"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1732428193991,"stop":1732428193991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193993,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1732428193993,"stop":1732428193993,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1732428193994,"stop":1732428193994,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f9c645ee48c4616c","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}},{"uid":"a7d4500da5fb8933","status":"passed","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"b01fd4e8d095b60f","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}},{"uid":"913459f449cde9ee","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}}]},"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"5eca272b3b393557.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4783529dae6eb3af.json b/allure-report/data/test-cases/5f2df3f2c9b86d77.json similarity index 79% rename from allure-report/data/test-cases/4783529dae6eb3af.json rename to allure-report/data/test-cases/5f2df3f2c9b86d77.json index 10f2226ddf1..ea7cc7b137d 100644 --- a/allure-report/data/test-cases/4783529dae6eb3af.json +++ b/allure-report/data/test-cases/5f2df3f2c9b86d77.json @@ -1 +1 @@ -{"uid":"4783529dae6eb3af","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"4783529dae6eb3af.json","parameterValues":[]} \ No newline at end of file +{"uid":"5f2df3f2c9b86d77","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"5f2df3f2c9b86d77.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5f6f3bc16b3488d6.json b/allure-report/data/test-cases/5f6f3bc16b3488d6.json new file mode 100644 index 00000000000..38077009085 --- /dev/null +++ b/allure-report/data/test-cases/5f6f3bc16b3488d6.json @@ -0,0 +1 @@ +{"uid":"5f6f3bc16b3488d6","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1732428194686,"stop":1732428194689,"duration":3},"description":"\n Testing epidemic function\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing epidemic function\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1732428194689,"stop":1732428194689,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1732428194691,"stop":1732428194691,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Disease Spread"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b890a6fea083097f","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}},{"uid":"6207ccc30173aa77","status":"passed","time":{"start":1724733473186,"stop":1724733473186,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"c1e0648976f6a694","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}},{"uid":"b3f7088fed8dedd7","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"5f6f3bc16b3488d6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5fabad9204d0747c.json b/allure-report/data/test-cases/5fabad9204d0747c.json new file mode 100644 index 00000000000..379b3a5fdfd --- /dev/null +++ b/allure-report/data/test-cases/5fabad9204d0747c.json @@ -0,0 +1 @@ +{"uid":"5fabad9204d0747c","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1732428194661,"stop":1732428194663,"duration":2},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194661,"stop":1732428194662,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Extend the list list","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c89e6a91bc0b9e52","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"23e61e29448b9218","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"826a0963540c6e75","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"4359475f5ec554bd","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"5fabad9204d0747c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/31cd5c9e8017f83c.json b/allure-report/data/test-cases/5fd184f18d9496f9.json similarity index 61% rename from allure-report/data/test-cases/31cd5c9e8017f83c.json rename to allure-report/data/test-cases/5fd184f18d9496f9.json index 79846050be2..4878057489a 100644 --- a/allure-report/data/test-cases/31cd5c9e8017f83c.json +++ b/allure-report/data/test-cases/5fd184f18d9496f9.json @@ -1 +1 @@ -{"uid":"31cd5c9e8017f83c","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1724735128914,"stop":1724735128930,"duration":16},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"92abbc4fad82e6db","name":"stdout","source":"92abbc4fad82e6db.txt","type":"text/plain","size":243}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724735128930,"stop":1724735128930,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"11b4e7794c00f220","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"1ef3e1da7f90eb82","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}}]},"tags":["FUNDAMENTALS","ARRAYS"]},"source":"31cd5c9e8017f83c.json","parameterValues":[]} \ No newline at end of file +{"uid":"5fd184f18d9496f9","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1724735128914,"stop":1724735128930,"duration":16},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1f33a24130d10b19","name":"stdout","source":"1f33a24130d10b19.txt","type":"text/plain","size":243}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724735128930,"stop":1724735128930,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"5fd184f18d9496f9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/eb3e9f6b3780b454.json b/allure-report/data/test-cases/5fda510dc29832db.json similarity index 59% rename from allure-report/data/test-cases/eb3e9f6b3780b454.json rename to allure-report/data/test-cases/5fda510dc29832db.json index 991e4fcb516..fdcd50e14ff 100644 --- a/allure-report/data/test-cases/eb3e9f6b3780b454.json +++ b/allure-report/data/test-cases/5fda510dc29832db.json @@ -1 +1 @@ -{"uid":"eb3e9f6b3780b454","name":"Testing length function","fullName":"kyu_7.fun_with_lists_length.test_length.LengthTestCase#test_length","historyId":"b71e871d53b429aef63593ea1f41c8bc","time":{"start":1724735129117,"stop":1724735129117,"duration":0},"description":"\n Testing length function\n\n The method length, which accepts a linked list\n (head), and returns the length of the list.\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a8cdc7c5d92ea524","name":"stdout","source":"a8cdc7c5d92ea524.txt","type":"text/plain","size":1127}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"abba91be3722688b","status":"passed","time":{"start":1724733473960,"stop":1724733473960,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"66511dda8143933e","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"1719ddf6913445c8.json","parameterValues":[]} \ No newline at end of file +{"uid":"602b6b1c829f1e7f","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8c002cae94869ae","name":"stdout","source":"8c002cae94869ae.txt","type":"text/plain","size":1127}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"602b6b1c829f1e7f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6030df3a53146090.json b/allure-report/data/test-cases/6030df3a53146090.json new file mode 100644 index 00000000000..dee69bacc95 --- /dev/null +++ b/allure-report/data/test-cases/6030df3a53146090.json @@ -0,0 +1 @@ +{"uid":"6030df3a53146090","name":"Testing solve function","fullName":"kyu_6.casino_chips.test_solve.SolveTestCase#test_solve","historyId":"47a8a15643c132c9b9f0d902bcff28dd","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ca0d330469f49836","name":"stdout","source":"ca0d330469f49836.txt","type":"text/plain","size":640}],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"6030df3a53146090.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6076e8e1aaaa11ab.json b/allure-report/data/test-cases/6076e8e1aaaa11ab.json new file mode 100644 index 00000000000..259f54af06b --- /dev/null +++ b/allure-report/data/test-cases/6076e8e1aaaa11ab.json @@ -0,0 +1 @@ +{"uid":"6076e8e1aaaa11ab","name":"Testing pig_it function","fullName":"kyu_5.simple_pig_latin.test_pig_it.PigItTestCase#test_pig_it","historyId":"c5f1cfe64ff8d3a4f16a4166c571797e","time":{"start":1732428194488,"stop":1732428194489,"duration":1},"description":"\n Testing pig_it function\n\n The function should mpve the first letter of each\n word to the end of it, then add \"ay\" to the end\n of the word. Leave punctuation marks untouched.\n :return:\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1732428194511,"stop":1732428194511,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1732428194512,"stop":1732428194512,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1732428194513,"stop":1732428194513,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MEMOIZATION"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"997065a61e801d4c","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}},{"uid":"b4abfaf3d77f3f23","status":"passed","time":{"start":1724733472999,"stop":1724733472999,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2965d2d3db0ea08e","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}},{"uid":"be5a8376fdcba717","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}}]},"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"607f84fe70696eb5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/431c7499a8a042ca.json b/allure-report/data/test-cases/6113acbf67a69117.json similarity index 63% rename from allure-report/data/test-cases/431c7499a8a042ca.json rename to allure-report/data/test-cases/6113acbf67a69117.json index 1fe440f8c3f..8d8465a1c49 100644 --- a/allure-report/data/test-cases/431c7499a8a042ca.json +++ b/allure-report/data/test-cases/6113acbf67a69117.json @@ -1 +1 @@ -{"uid":"431c7499a8a042ca","name":"Testing easy_diagonal function","fullName":"kyu_6.easy_diagonal.test_diagonal.EasyDiagonalTestCase#test_easy_diagonal","historyId":"5d9c9166bf610b28a284723b5b23aab1","time":{"start":1724733473218,"stop":1724733473889,"duration":671},"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b8749033ef3225ff","name":"stdout","source":"b8749033ef3225ff.txt","type":"text/plain","size":524}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Easy Diagonal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"431c7499a8a042ca.json","parameterValues":[]} \ No newline at end of file +{"uid":"6113acbf67a69117","name":"Testing easy_diagonal function","fullName":"kyu_6.easy_diagonal.test_diagonal.EasyDiagonalTestCase#test_easy_diagonal","historyId":"5d9c9166bf610b28a284723b5b23aab1","time":{"start":1724733473218,"stop":1724733473889,"duration":671},"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6cd50ae6a92d4a65","name":"stdout","source":"6cd50ae6a92d4a65.txt","type":"text/plain","size":524}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Easy Diagonal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"6113acbf67a69117.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/614133ca9c69e105.json b/allure-report/data/test-cases/614133ca9c69e105.json new file mode 100644 index 00000000000..4f21c5c2228 --- /dev/null +++ b/allure-report/data/test-cases/614133ca9c69e105.json @@ -0,0 +1 @@ +{"uid":"614133ca9c69e105","name":"Testing check_for_factor function: positive flow","fullName":"kyu_8.grasshopper_check_for_factor.test_check_for_factor.CheckForFactorTestCase#test_check_for_factor_false","historyId":"8c287dae332df512fc4a9755020ffedc","time":{"start":1732428196195,"stop":1732428196195,"duration":0},"description":"\n Testing check_for_factor function.\n\n This function should test if the\n factor is a factor of base.\n\n Return false if it is not a factor.\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6e51aca385250e4","name":"stdout","source":"6e51aca385250e4.txt","type":"text/plain","size":434}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"9035abe5e1151932.json","parameterValues":[]} \ No newline at end of file +{"uid":"614d8ec123787b56","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ef14b2090647c37e","name":"stdout","source":"ef14b2090647c37e.txt","type":"text/plain","size":434}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"614d8ec123787b56.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d757011cc42c205e.json b/allure-report/data/test-cases/6207ccc30173aa77.json similarity index 64% rename from allure-report/data/test-cases/d757011cc42c205e.json rename to allure-report/data/test-cases/6207ccc30173aa77.json index 44e04e6b1cd..bc15b602d44 100644 --- a/allure-report/data/test-cases/d757011cc42c205e.json +++ b/allure-report/data/test-cases/6207ccc30173aa77.json @@ -1 +1 @@ -{"uid":"d757011cc42c205e","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c954d80fa61d867d","name":"stdout","source":"c954d80fa61d867d.txt","type":"text/plain","size":1093}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Disease Spread"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"d757011cc42c205e.json","parameterValues":[]} \ No newline at end of file +{"uid":"6207ccc30173aa77","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d8b7ee3418e7b9e0","name":"stdout","source":"d8b7ee3418e7b9e0.txt","type":"text/plain","size":1093}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Disease Spread"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"6207ccc30173aa77.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/62141a9b45e036f9.json b/allure-report/data/test-cases/62141a9b45e036f9.json new file mode 100644 index 00000000000..1c996b9b4b6 --- /dev/null +++ b/allure-report/data/test-cases/62141a9b45e036f9.json @@ -0,0 +1 @@ +{"uid":"62141a9b45e036f9","name":"Testing duplicate_encode function","fullName":"kyu_6.duplicate_encoder.test_duplicate_encode.DuplicateEncodeTestCase#test_duplicate_encode","historyId":"fa07af113ba280dc5a89690a520b3897","time":{"start":1732428194698,"stop":1732428194698,"duration":0},"description":"\n Testing duplicate_encode function\n with various test inputs\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c126cf9c398e7752","name":"stdout","source":"c126cf9c398e7752.txt","type":"text/plain","size":263}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b5f6e3f148925a4f","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"d8e9539521c4ca00","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"627da61e5891aa44.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/62e01ffb20b661b5.json b/allure-report/data/test-cases/62e01ffb20b661b5.json new file mode 100644 index 00000000000..7a9af991b34 --- /dev/null +++ b/allure-report/data/test-cases/62e01ffb20b661b5.json @@ -0,0 +1 @@ +{"uid":"62e01ffb20b661b5","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_count_letters_and_digits","historyId":"0e1169325045c4d7d4ed6982c76387ed","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1732428195853,"stop":1732428195853,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"62e01ffb20b661b5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/62ef482e2cb3493b.json b/allure-report/data/test-cases/62ef482e2cb3493b.json new file mode 100644 index 00000000000..e1a62398e77 --- /dev/null +++ b/allure-report/data/test-cases/62ef482e2cb3493b.json @@ -0,0 +1 @@ +{"uid":"62ef482e2cb3493b","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1732428196489,"stop":1732428196489,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1732428196489,"stop":1732428196489,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1732428196491,"stop":1732428196491,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"3cb4765f4f4fe8e7","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"cc1bd3cedb1bfef0","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"1b3bd0a5ea1aa072","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"2030ea00b6998f67","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"62ef482e2cb3493b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1073662453fffbc9.json b/allure-report/data/test-cases/6309fbba516976ae.json similarity index 57% rename from allure-report/data/test-cases/1073662453fffbc9.json rename to allure-report/data/test-cases/6309fbba516976ae.json index 9995afddadd..89bce92bc71 100644 --- a/allure-report/data/test-cases/1073662453fffbc9.json +++ b/allure-report/data/test-cases/6309fbba516976ae.json @@ -1 +1 @@ -{"uid":"1073662453fffbc9","name":"Testing hoop_count function (negative test case)","fullName":"kyu_8.keep_up_the_hoop.test_hoop_count.HoopCountTestCase#test_hoop_count_negative","historyId":"89ee625343ed07ab852f830d9cc358b3","time":{"start":1724735129570,"stop":1724735129570,"duration":0},"descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b9b05bf139af2d32","name":"stdout","source":"b9b05bf139af2d32.txt","type":"text/plain","size":23}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"6af8fedb1f0ef3c6.json","parameterValues":[]} \ No newline at end of file +{"uid":"6373ea673c2617a2","name":"Negative test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_negative","historyId":"4a2df53975623c10d30ec1c6932ba04a","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a9f925f082e601ea","name":"stdout","source":"a9f925f082e601ea.txt","type":"text/plain","size":23}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"6373ea673c2617a2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f50d911c93ffbcb0.json b/allure-report/data/test-cases/6399c372aa4005f1.json similarity index 56% rename from allure-report/data/test-cases/f50d911c93ffbcb0.json rename to allure-report/data/test-cases/6399c372aa4005f1.json index 27f17000fb4..6154a4b0a69 100644 --- a/allure-report/data/test-cases/f50d911c93ffbcb0.json +++ b/allure-report/data/test-cases/6399c372aa4005f1.json @@ -1 +1 @@ -{"uid":"f50d911c93ffbcb0","name":"Testing remove_char function","fullName":"kyu_8.remove_first_and_last_character.test_remove_char.RemoveCharTestCase#test_remove_char","historyId":"094915dd36d829c22ed2375a32962ac5","time":{"start":1724735129633,"stop":1724735129633,"duration":0},"description":"\n Test that 'remove_char' function\n removes the first and\n last characters of a string.\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4646d812c4a39ce","name":"stdout","source":"4646d812c4a39ce.txt","type":"text/plain","size":554}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"f8cc7e1ba1a4852f.json","parameterValues":[]} \ No newline at end of file +{"uid":"64d00badde981bd3","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e7e4c2d208b9b87","name":"stdout","source":"e7e4c2d208b9b87.txt","type":"text/plain","size":554}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"64d00badde981bd3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/656eaa4febf44ace.json b/allure-report/data/test-cases/656eaa4febf44ace.json new file mode 100644 index 00000000000..b5b04141102 --- /dev/null +++ b/allure-report/data/test-cases/656eaa4febf44ace.json @@ -0,0 +1 @@ +{"uid":"656eaa4febf44ace","name":"a and b are equal","fullName":"kyu_7.disemvowel_trolls.test_disemvowel_trolls.DisemvowelTestCase#test_disemvowel","historyId":"4171a558a2bea15b5a0546d36c9a1c63","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"description":"\n The string \"This website is for losers LOL!\"\n should become \"Ths wbst s fr lsrs LL!\"\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5763b31517fb1cf6","name":"stdout","source":"5763b31517fb1cf6.txt","type":"text/plain","size":167}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"91e2410535ccc997.json","parameterValues":[]} \ No newline at end of file +{"uid":"684d4d6fbb32213a","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"62d969149cac19e2","name":"stdout","source":"62d969149cac19e2.txt","type":"text/plain","size":167}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"684d4d6fbb32213a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/55d1d73293e16236.json b/allure-report/data/test-cases/68ae9688c7c99a04.json similarity index 65% rename from allure-report/data/test-cases/55d1d73293e16236.json rename to allure-report/data/test-cases/68ae9688c7c99a04.json index 69c0ae15a65..d2c88d9c39d 100644 --- a/allure-report/data/test-cases/55d1d73293e16236.json +++ b/allure-report/data/test-cases/68ae9688c7c99a04.json @@ -1 +1 @@ -{"uid":"55d1d73293e16236","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9e063e588b090ea7","name":"stdout","source":"9e063e588b090ea7.txt","type":"text/plain","size":882}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"55d1d73293e16236.json","parameterValues":[]} \ No newline at end of file +{"uid":"68ae9688c7c99a04","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4c19c67f026536b3","name":"stdout","source":"4c19c67f026536b3.txt","type":"text/plain","size":882}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"68ae9688c7c99a04.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/68c4a39d8a6017b.json b/allure-report/data/test-cases/68c4a39d8a6017b.json deleted file mode 100644 index 37b51f0c8b3..00000000000 --- a/allure-report/data/test-cases/68c4a39d8a6017b.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"68c4a39d8a6017b","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"189c0101c5666165","name":"stdout","source":"189c0101c5666165.txt","type":"text/plain","size":3097}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"PARSING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"RANKING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"feature","value":"String"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"68c4a39d8a6017b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/30fbee992b0ca53e.json b/allure-report/data/test-cases/68db53b8169ad957.json similarity index 74% rename from allure-report/data/test-cases/30fbee992b0ca53e.json rename to allure-report/data/test-cases/68db53b8169ad957.json index b7ecabc632f..cda4d59859b 100644 --- a/allure-report/data/test-cases/30fbee992b0ca53e.json +++ b/allure-report/data/test-cases/68db53b8169ad957.json @@ -1 +1 @@ -{"uid":"30fbee992b0ca53e","name":"Testing 'solution' function","fullName":"kyu_7.pull_your_words_together_man.test_sentencify.SentencifyTestCase#test_sentencify","historyId":"5821e6355bce2a3bf46d4ce3e55de034","time":{"start":1724733474382,"stop":1724733474382,"duration":0},"description":"\n Testing 'sentencify' function.\n\n The function should:\n\n 1. Capitalise the first letter of the first word.\n 2. Add a period (.) to the end of the sentence.\n 3. Join the words into a complete string, with spaces.\n 4. Do no other manipulation on the words.\n\n :return:\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string aba and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string moOse and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"dc00b83d62a7bfbf","name":"stdout","source":"dc00b83d62a7bfbf.txt","type":"text/plain","size":401}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Isograms"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"String"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"1dfdd5c5551a6420.json","parameterValues":[]} \ No newline at end of file +{"uid":"691701add6daaf89","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string aba and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string moOse and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"974d8c9279e15557","name":"stdout","source":"974d8c9279e15557.txt","type":"text/plain","size":401}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Isograms"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"String"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"691701add6daaf89.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/474af6c568bdf675.json b/allure-report/data/test-cases/693d19da33d622de.json similarity index 65% rename from allure-report/data/test-cases/474af6c568bdf675.json rename to allure-report/data/test-cases/693d19da33d622de.json index ab9df8f38fb..cb49a1a81ba 100644 --- a/allure-report/data/test-cases/474af6c568bdf675.json +++ b/allure-report/data/test-cases/693d19da33d622de.json @@ -1 +1 @@ -{"uid":"474af6c568bdf675","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Insert items to the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"41c90fa760e8d420","name":"stdout","source":"41c90fa760e8d420.txt","type":"text/plain","size":261}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"474af6c568bdf675.json","parameterValues":[]} \ No newline at end of file +{"uid":"693d19da33d622de","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Insert items to the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f24a9f86ff4ef095","name":"stdout","source":"f24a9f86ff4ef095.txt","type":"text/plain","size":261}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"693d19da33d622de.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/698c99dcac4b0d93.json b/allure-report/data/test-cases/698c99dcac4b0d93.json new file mode 100644 index 00000000000..0abcf57b0ef --- /dev/null +++ b/allure-report/data/test-cases/698c99dcac4b0d93.json @@ -0,0 +1 @@ +{"uid":"698c99dcac4b0d93","name":"Verify that greet function returns the proper message","fullName":"kyu_8.grasshopper_personalized_message.test_grasshopper_personalized_message.GreetTestCase#test_greet","historyId":"c07c7cb9e4aa2b6b273c9327f48ca674","time":{"start":1732428196215,"stop":1732428196215,"duration":0},"description":"\n Use conditionals to to verify that greet\n function returns the proper message.\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b653a3e02677ec62","name":"stdout","source":"b653a3e02677ec62.txt","type":"text/plain","size":23}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"6af8fedb1f0ef3c6","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"5e4b0e05a0862f7e","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"69f65011f131e2b6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6a1d96979e635e7f.json b/allure-report/data/test-cases/6a1d96979e635e7f.json deleted file mode 100644 index 73fadddd7a7..00000000000 --- a/allure-report/data/test-cases/6a1d96979e635e7f.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"6a1d96979e635e7f","name":"Testing 'save' function: positive","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_positive","historyId":"b1ff2214ba100eb1c8bc62e73e12889e","time":{"start":1724735129102,"stop":1724735129102,"duration":0},"description":"\n Testing 'save' function: positive\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"6d7f7d9659ba7dd5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6e3ab906ce5621b5.json b/allure-report/data/test-cases/6e3ab906ce5621b5.json new file mode 100644 index 00000000000..d81114718c0 --- /dev/null +++ b/allure-report/data/test-cases/6e3ab906ce5621b5.json @@ -0,0 +1 @@ +{"uid":"6e3ab906ce5621b5","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1732428194529,"stop":1732428194529,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7362d176d35d3813","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}},{"uid":"9abe86e868e9efe6","status":"passed","time":{"start":1724733473030,"stop":1724733473030,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"6cad203fab564c60","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}},{"uid":"63cbfe00daba1c69","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}}]},"tags":["ARRAY","ALGORITHMS"]},"source":"6e3ab906ce5621b5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6e3ce129a9f8f588.json b/allure-report/data/test-cases/6e3ce129a9f8f588.json new file mode 100644 index 00000000000..bc6fcc72643 --- /dev/null +++ b/allure-report/data/test-cases/6e3ce129a9f8f588.json @@ -0,0 +1 @@ +{"uid":"6e3ce129a9f8f588","name":"Testing 'sum_triangular_numbers' with big number as an input","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_big_number","historyId":"e2716f691be2a9d6b5fd30d66b1f784d","time":{"start":1724733474476,"stop":1724733474476,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with big number as an input\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b4f27bd29772e298","name":"stdout","source":"b4f27bd29772e298.txt","type":"text/plain","size":117}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"133341d40af1e905.json","parameterValues":[]} \ No newline at end of file +{"uid":"6f0b2af516b0f755","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"b94b97d784c6cf01","name":"stdout","source":"b94b97d784c6cf01.txt","type":"text/plain","size":117}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"6f0b2af516b0f755.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/84f17449b7b13451.json b/allure-report/data/test-cases/6fbd93f1e3abe9a5.json similarity index 65% rename from allure-report/data/test-cases/84f17449b7b13451.json rename to allure-report/data/test-cases/6fbd93f1e3abe9a5.json index f389ab11676..0e31b0f3103 100644 --- a/allure-report/data/test-cases/84f17449b7b13451.json +++ b/allure-report/data/test-cases/6fbd93f1e3abe9a5.json @@ -1 +1 @@ -{"uid":"84f17449b7b13451","name":"Testing the 'solution' function","fullName":"kyu_6.multiples_of_3_or_5.test_solution.SolutionTestCase#test_solution","historyId":"c387db789a67b80c29f3c3ba2e6c9bce","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"description":"\n Testing solution function\n\n If we list all the natural numbers below 10\n that are multiples of 3 or 5, we get 3, 5, 6 and 9.\n The sum of these multiples is 23.\n\n Finish the solution so that it returns the sum of\n all the multiples of 3 or 5 below the number passed in.\n\n Note: If the number is a multiple of both 3 and 5,\n only count it once.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 38, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"55e4a84277d15d0d","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}},{"uid":"a8b77a6618ff7e4c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472921,"stop":1724733472921,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"84fd4c67efee5295","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}},{"uid":"62bf772c3a2aa5d2","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}}]},"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"70eff3ae24ccc67a.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/711928de75b599ba.json b/allure-report/data/test-cases/711928de75b599ba.json
new file mode 100644
index 00000000000..54eecf9ee2d
--- /dev/null
+++ b/allure-report/data/test-cases/711928de75b599ba.json
@@ -0,0 +1 @@
+{"uid":"711928de75b599ba","name":"Testing 'factorial' function","fullName":"kyu_7.factorial.test_factorial.FactorialTestCase#test_factorial","historyId":"9f3faef7cd6efbe5a04de4e9c02ed5e1","time":{"start":1732428195795,"stop":1732428195795,"duration":0},"description":"\n Testing 'factorial' function\n\n In mathematics, the factorial of a non-negative integer n,\n denoted by n!, is the product of all positive integers less\n than or equal to n. For example: 5! = 5 * 4 * 3 * 2 * 1 = 120.\n By convention the value of 0! is 1.\n\n Write a function to calculate factorial for a given input.\n If input is below 0 or above 12 throw an exception of type\n ValueError (Python).\n :return:\n ","descriptionHtml":"Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"ac68097df5e78e9a","name":"stdout","source":"ac68097df5e78e9a.txt","type":"text/plain","size":277}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e41551e078ed42ea","status":"passed","time":{"start":1724733473030,"stop":1724733473030,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"63cbfe00daba1c69","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}}]},"tags":["ARRAY","ALGORITHMS"]},"source":"6cad203fab564c60.json","parameterValues":[]} \ No newline at end of file +{"uid":"7362d176d35d3813","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ff2bf17d38e7cc3b","name":"stdout","source":"ff2bf17d38e7cc3b.txt","type":"text/plain","size":277}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"7362d176d35d3813.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b1d54b76165521a0.json b/allure-report/data/test-cases/73a56012085cbb67.json similarity index 55% rename from allure-report/data/test-cases/b1d54b76165521a0.json rename to allure-report/data/test-cases/73a56012085cbb67.json index ff628ed7082..ff5e175accf 100644 --- a/allure-report/data/test-cases/b1d54b76165521a0.json +++ b/allure-report/data/test-cases/73a56012085cbb67.json @@ -1 +1 @@ -{"uid":"b1d54b76165521a0","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"616f142dc436d37a","name":"stdout","source":"616f142dc436d37a.txt","type":"text/plain","size":1865}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"1e3570598c901af4","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"164087ecc666d9a0","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"b1d54b76165521a0.json","parameterValues":[]} \ No newline at end of file +{"uid":"73a56012085cbb67","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ff15e181fd0e6388","name":"stdout","source":"ff15e181fd0e6388.txt","type":"text/plain","size":1865}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"73a56012085cbb67.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/deed80da6e08bd69.json b/allure-report/data/test-cases/73db1f36a5925004.json similarity index 60% rename from allure-report/data/test-cases/deed80da6e08bd69.json rename to allure-report/data/test-cases/73db1f36a5925004.json index 07dbe7724a3..69ea899156c 100644 --- a/allure-report/data/test-cases/deed80da6e08bd69.json +++ b/allure-report/data/test-cases/73db1f36a5925004.json @@ -1 +1 @@ -{"uid":"deed80da6e08bd69","name":"'fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e9ba7465215b13fc","name":"stdout","source":"e9ba7465215b13fc.txt","type":"text/plain","size":611}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"95172229a5a9ad6","status":"passed","time":{"start":1724733474850,"stop":1724733474850,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"1152e12f582a6d83","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}}]},"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"deed80da6e08bd69.json","parameterValues":[]} \ No newline at end of file +{"uid":"73db1f36a5925004","name":"'fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8a1d25baaaa2cac0","name":"stdout","source":"8a1d25baaaa2cac0.txt","type":"text/plain","size":611}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"73db1f36a5925004.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/73f30fbb9798a5d5.json b/allure-report/data/test-cases/73f30fbb9798a5d5.json new file mode 100644 index 00000000000..4415b957292 --- /dev/null +++ b/allure-report/data/test-cases/73f30fbb9798a5d5.json @@ -0,0 +1 @@ +{"uid":"73f30fbb9798a5d5","name":"goals function verification","fullName":"kyu_8.grasshopper_messi_goals_function.test_messi_goals_function.GoalsTestCase#test_goals","historyId":"7c1c8c6318c554c86b695deacecf1854","time":{"start":1732428196208,"stop":1732428196209,"duration":1},"description":"\n Verify that the function returns Messi's\n total number of goals in all three leagues.\n :return:\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1732428194139,"stop":1732428194139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert training","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert battle","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":12,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1732428194147,"stop":1732428194147,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1938e37bf1525466","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}},{"uid":"286a2c6d22a3ea0b","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"37b95a78feb35857","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}},{"uid":"bc3230f80ad8864d","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"751027d0ac0cc021.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7560669431ea4aa8.json b/allure-report/data/test-cases/7560669431ea4aa8.json new file mode 100644 index 00000000000..02db07debc0 --- /dev/null +++ b/allure-report/data/test-cases/7560669431ea4aa8.json @@ -0,0 +1 @@ +{"uid":"7560669431ea4aa8","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1732428194292,"stop":1732428194424,"duration":132},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1732428194291,"stop":1732428194291,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194324,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194324,"stop":1732428194391,"duration":67},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194391,"stop":1732428194424,"duration":33},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1732428194434,"stop":1732428194434,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Integers: Recreation One"},{"name":"tag","value":"OPTIMIZATION"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7da87d8449dbfb8b","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}},{"uid":"87c07388b10e55d5","status":"passed","time":{"start":1724733472796,"stop":1724733472921,"duration":125}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"7fd5632b0213855d","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}},{"uid":"60f5877935ced5c5","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}}]},"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"7560669431ea4aa8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/13e77cd2d97ddcd8.json b/allure-report/data/test-cases/75ba956cc9ee13f9.json similarity index 61% rename from allure-report/data/test-cases/13e77cd2d97ddcd8.json rename to allure-report/data/test-cases/75ba956cc9ee13f9.json index 2e9eaa7b524..115a27f9038 100644 --- a/allure-report/data/test-cases/13e77cd2d97ddcd8.json +++ b/allure-report/data/test-cases/75ba956cc9ee13f9.json @@ -1 +1 @@ -{"uid":"13e77cd2d97ddcd8","name":"Testing 'generate_hashtag' function","fullName":"kyu_5.the_hashtag_generator.test_generate_hashtag.GenerateHashtagTestCase#test_generate_hashtag","historyId":"ff2324e4a058a6c42486fd5aff532ecf","time":{"start":1724733473014,"stop":1724733473014,"duration":0},"description":"\n Testing 'generate_hashtag' function\n ","descriptionHtml":"The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724735127938,"stop":1724735127938,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d1528cec1dd8dea3","name":"stdout","source":"d1528cec1dd8dea3.txt","type":"text/plain","size":318}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2cfa19c331ab824b","status":"passed","time":{"start":1724733473046,"stop":1724733473061,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"66f1b8d1e5ed1dbe","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"585949d19b46a5d2.json","parameterValues":[]} \ No newline at end of file +{"uid":"772c9d6fdd465a8a","name":"Testing 'thirt' function","fullName":"kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase#test_thirt","historyId":"b223f14337b9b49b6e64d94d9479e857","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724735127938,"stop":1724735127938,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"92cddf6ef1a2b768","name":"stdout","source":"92cddf6ef1a2b768.txt","type":"text/plain","size":318}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"772c9d6fdd465a8a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/777edc280c74020d.json b/allure-report/data/test-cases/777edc280c74020d.json new file mode 100644 index 00000000000..d3c953ae516 --- /dev/null +++ b/allure-report/data/test-cases/777edc280c74020d.json @@ -0,0 +1 @@ +{"uid":"777edc280c74020d","name":"Testing 'thirt' function","fullName":"kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase#test_thirt","historyId":"b223f14337b9b49b6e64d94d9479e857","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"description":"\n Testing 'thirt' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'thirt' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1732428194553,"stop":1732428194553,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"772c9d6fdd465a8a","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"7a3ebc7dbd092b26","status":"passed","time":{"start":1724733473046,"stop":1724733473061,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"585949d19b46a5d2","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"66f1b8d1e5ed1dbe","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"777edc280c74020d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a54c934450b934d7.json b/allure-report/data/test-cases/77e868a9cd944330.json similarity index 81% rename from allure-report/data/test-cases/a54c934450b934d7.json rename to allure-report/data/test-cases/77e868a9cd944330.json index f387fe05940..6f5d5844d72 100644 --- a/allure-report/data/test-cases/a54c934450b934d7.json +++ b/allure-report/data/test-cases/77e868a9cd944330.json @@ -1 +1 @@ -{"uid":"a54c934450b934d7","name":"Testing 'feast' function","fullName":"kyu_8.the_feast_of_many_beasts.test_feast.FeastTestCase#test_feast","historyId":"963bc543b4e4096b877e161985d8949c","time":{"start":1724733474929,"stop":1724733474929,"duration":0},"description":"\n Testing 'feast' function with various test inputs\n\n Testing a function feast that takes the animal's\n name and dish as arguments and returns true or\n false to indicate whether the beast is allowed\n to bring the dish to the feast.\n\n Assume that beast and dish are always lowercase strings,\n and that each has at least two letters. beast and dish\n may contain hyphens and spaces, but these will not appear\n at the beginning or end of the string. They will not\n contain numerals.\n\n There is just one rule: the dish must start and end with\n the same letters as the animal's name. For example, the\n great blue heron is bringing garlic naan and the chickadee\n is bringing chocolate cake.\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f25bb18adfb0c750","name":"stdout","source":"f25bb18adfb0c750.txt","type":"text/plain","size":318}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"2cfa19c331ab824b.json","parameterValues":[]} \ No newline at end of file +{"uid":"7a3ebc7dbd092b26","name":"Testing 'thirt' function","fullName":"kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase#test_thirt","historyId":"b223f14337b9b49b6e64d94d9479e857","time":{"start":1724733473046,"stop":1724733473061,"duration":15},"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d8ed65aadf059368","name":"stdout","source":"d8ed65aadf059368.txt","type":"text/plain","size":318}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"7a3ebc7dbd092b26.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a70ffb4d0a92e5c8.json b/allure-report/data/test-cases/7b13f1197b1367b6.json similarity index 58% rename from allure-report/data/test-cases/a70ffb4d0a92e5c8.json rename to allure-report/data/test-cases/7b13f1197b1367b6.json index 4594d622193..0ac6dbc7515 100644 --- a/allure-report/data/test-cases/a70ffb4d0a92e5c8.json +++ b/allure-report/data/test-cases/7b13f1197b1367b6.json @@ -1 +1 @@ -{"uid":"a70ffb4d0a92e5c8","name":"All chars are in mixed case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_mixed","historyId":"d4bb68fb8c0e59fc03fed525cca43eb5","time":{"start":1724735128000,"stop":1724735128000,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in mixed case\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1732428193969,"stop":1732428193969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FORMATS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Human readable duration format"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"31050b40d7651adc","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"bc039aea1f276c5c","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"47f8df09a84d8337","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"409595d25cc5d60c","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"7cc0844ab5ecf216.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7d6c6bb6b47e11d4.json b/allure-report/data/test-cases/7d6c6bb6b47e11d4.json new file mode 100644 index 00000000000..76293d6d2fb --- /dev/null +++ b/allure-report/data/test-cases/7d6c6bb6b47e11d4.json @@ -0,0 +1 @@ +{"uid":"7d6c6bb6b47e11d4","name":"Testing toJadenCase function (positive)","fullName":"kyu_7.jaden_casing_strings.test_jaden_casing_strings.JadenCasingStringsTestCase#test_to_jaden_case_positive","historyId":"7c48f5c6aa887d1bc76d081b028cf7cf","time":{"start":1732428195874,"stop":1732428195875,"duration":1},"description":"\n Simple positive test\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5a6636ef2e259cf6","name":"stdout","source":"5a6636ef2e259cf6.txt","type":"text/plain","size":2146}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6a793815cad01bd2","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"b78c37ec3b0f496f","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"e6a3da330525d2f4.json","parameterValues":[]} \ No newline at end of file +{"uid":"7d905be84b5c0b77","name":"Testing to_table function","fullName":"kyu_6.array_to_html_table.test_list_to_html_table.ArrayToTableTestCase#test_array_to_table_function","historyId":"d7b951f3d87d7ec30599f08ae5567eb7","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4f617786d1167bf5","name":"stdout","source":"4f617786d1167bf5.txt","type":"text/plain","size":2146}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"7d905be84b5c0b77.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7fd5632b0213855d.json b/allure-report/data/test-cases/7da87d8449dbfb8b.json similarity index 57% rename from allure-report/data/test-cases/7fd5632b0213855d.json rename to allure-report/data/test-cases/7da87d8449dbfb8b.json index 35d2412bde0..3013b3daa23 100644 --- a/allure-report/data/test-cases/7fd5632b0213855d.json +++ b/allure-report/data/test-cases/7da87d8449dbfb8b.json @@ -1 +1 @@ -{"uid":"7fd5632b0213855d","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724735127688,"stop":1724735127813,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127703,"duration":15},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127703,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127735,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127735,"stop":1724735127781,"duration":46},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127781,"stop":1724735127813,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4b46eca85ecd31e8","name":"stdout","source":"4b46eca85ecd31e8.txt","type":"text/plain","size":932}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724735127813,"stop":1724735127813,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Integers: Recreation One"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"OPTIMIZATION"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2512233f29820ca9","status":"passed","time":{"start":1724733472796,"stop":1724733472921,"duration":125}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"60f5877935ced5c5","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}}]},"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"7fd5632b0213855d.json","parameterValues":[]} \ No newline at end of file +{"uid":"7da87d8449dbfb8b","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724735127688,"stop":1724735127813,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127703,"duration":15},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127703,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127735,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127735,"stop":1724735127781,"duration":46},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127781,"stop":1724735127813,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d8f05623e6466063","name":"stdout","source":"d8f05623e6466063.txt","type":"text/plain","size":932}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724735127813,"stop":1724735127813,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Integers: Recreation One"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"OPTIMIZATION"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"7da87d8449dbfb8b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7e357cecc68f801.json b/allure-report/data/test-cases/7e357cecc68f801.json new file mode 100644 index 00000000000..1713cebdab0 --- /dev/null +++ b/allure-report/data/test-cases/7e357cecc68f801.json @@ -0,0 +1 @@ +{"uid":"7e357cecc68f801","name":"Testing alphanumeric function","fullName":"kyu_5.not_very_secure.test_alphanumeric.AlphanumericTestCase#test_alphanumeric","historyId":"e4b3b27b629bbd5f25abab144f66de37","time":{"start":1724735127860,"stop":1724735127860,"duration":0},"description":"\n Testing alphanumeric function with\n various test inputs\n\n The string has the following conditions\n to be alphanumeric only\n\n 1. At least one character (\"\" is not valid)\n 2. Allowed characters are uppercase or lowercase\n latin letters and digits from 0 to 9\n 3. No whitespaces or underscore or special chars\n\n :return: None\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"63766a355340dea4","name":"stdout","source":"63766a355340dea4.txt","type":"text/plain","size":1579}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"aacbcab78401e86c","status":"passed","time":{"start":1724733472452,"stop":1724733472499,"duration":47}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"521b14729542d5c4","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}}]},"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"82619e3fb0e84d4d.json","parameterValues":[]} \ No newline at end of file +{"uid":"7e5150fbd4a33237","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1724735127313,"stop":1724735127391,"duration":78},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a7f10bb4c8e33c64","name":"stdout","source":"a7f10bb4c8e33c64.txt","type":"text/plain","size":1579}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"7e5150fbd4a33237.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7e997a5018ff0710.json b/allure-report/data/test-cases/7e997a5018ff0710.json new file mode 100644 index 00000000000..d63d84c602d --- /dev/null +++ b/allure-report/data/test-cases/7e997a5018ff0710.json @@ -0,0 +1 @@ +{"uid":"7e997a5018ff0710","name":"Testing 'longest_repetition' function","fullName":"kyu_6.longest_repetition.test_longest_repetition.LongestRepetitionTestCase#test_longest_repetition","historyId":"6431e0366c9c302e03ac01343fb7ea77","time":{"start":1732428195517,"stop":1732428195517,"duration":0},"description":"\n For a given string s find the character c (or C) with\n longest consecutive repetition and return: (c, l)\n where l (or L) is the length of the repetition.\n\n For empty string return: ('', 0)\n :return:\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4158b1e0c4f5a122","name":"stdout","source":"4158b1e0c4f5a122.txt","type":"text/plain","size":1865}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Lists"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"1e3570598c901af4.json","parameterValues":[]} \ No newline at end of file +{"uid":"815ff7102e2d18bc","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a31af19dcd964af7","name":"stdout","source":"a31af19dcd964af7.txt","type":"text/plain","size":1865}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Lists"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"815ff7102e2d18bc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dee0416f79d22a0d.json b/allure-report/data/test-cases/8173581ebbb7cc32.json similarity index 54% rename from allure-report/data/test-cases/dee0416f79d22a0d.json rename to allure-report/data/test-cases/8173581ebbb7cc32.json index 198fff41eef..77d5029aa36 100644 --- a/allure-report/data/test-cases/dee0416f79d22a0d.json +++ b/allure-report/data/test-cases/8173581ebbb7cc32.json @@ -1 +1 @@ -{"uid":"dee0416f79d22a0d","name":"Testing tickets function","fullName":"kyu_6.vasya_clerk.test_tickets.TicketsTestCase#test_tickets","historyId":"bb3964d396ef802dceada9777cff8e45","time":{"start":1724735128977,"stop":1724735128977,"duration":0},"description":"\n Testing tickets function with various test inputs.\n\n The new \"Avengers\" movie has just been released!\n There are a lot of people at the cinema box office\n standing in a huge line. Each of them has a single\n 100, 50 or 25 dollar bill. An \"Avengers\" ticket\n costs 25 dollars.\n\n Vasya is currently working as a clerk.\n He wants to sell a ticket to every single person\n in this line.\n\n Can Vasya sell a ticket to every person and give change\n if he initially has no money and sells the tickets strictly\n in the order people queue?\n\n The function should return YES, if Vasya can sell\n a ticket to every person and give change with the\n bills he has at hand at that moment. Otherwise return NO.\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5c7638f94c1897db","name":"stdout","source":"5c7638f94c1897db.txt","type":"text/plain","size":434}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9035abe5e1151932","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"db7b4c897ddcf1a6","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}}]},"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"7b2352a8e3675c67.json","parameterValues":[]} \ No newline at end of file +{"uid":"827104e07f2ca2d0","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"25583e198df733bf","name":"stdout","source":"25583e198df733bf.txt","type":"text/plain","size":434}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"827104e07f2ca2d0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3cf8d83dbb2d66b5.json b/allure-report/data/test-cases/82a681e3f0c8f54d.json similarity index 62% rename from allure-report/data/test-cases/3cf8d83dbb2d66b5.json rename to allure-report/data/test-cases/82a681e3f0c8f54d.json index 741a7dc5422..33a5f4f91ef 100644 --- a/allure-report/data/test-cases/3cf8d83dbb2d66b5.json +++ b/allure-report/data/test-cases/82a681e3f0c8f54d.json @@ -1 +1 @@ -{"uid":"3cf8d83dbb2d66b5","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724735128836,"stop":1724735128852,"duration":16},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"839567f1e1e69ee5","name":"stdout","source":"839567f1e1e69ee5.txt","type":"text/plain","size":2621}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"41ca81ef54591f7f","status":"passed","time":{"start":1724733473991,"stop":1724733473991,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"f0e71551541527fc","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}}]},"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"3cf8d83dbb2d66b5.json","parameterValues":[]} \ No newline at end of file +{"uid":"82a681e3f0c8f54d","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724735128836,"stop":1724735128852,"duration":16},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a3af1182be2fa344","name":"stdout","source":"a3af1182be2fa344.txt","type":"text/plain","size":2621}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"82a681e3f0c8f54d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/82a8f1ffa445d40.json b/allure-report/data/test-cases/82a8f1ffa445d40.json new file mode 100644 index 00000000000..ef3f80534cb --- /dev/null +++ b/allure-report/data/test-cases/82a8f1ffa445d40.json @@ -0,0 +1 @@ +{"uid":"82a8f1ffa445d40","name":"AND logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_and","historyId":"49af4a8ebdc007fac4acbc085138b80e","time":{"start":1724733474804,"stop":1724733474804,"duration":0},"description":"\n And (∧) is the truth-functional\n operator of logical conjunction\n\n The and of a set of operands is true\n if and only if all of its operands are true.\n\n Source:\n https://en.wikipedia.org/wiki/Logical_conjunction\n\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c60a729cdea9a7d9","name":"stdout","source":"c60a729cdea9a7d9.txt","type":"text/plain","size":2817}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":30,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"a97caba53074497b.json","parameterValues":[]} \ No newline at end of file +{"uid":"837e4ce24ac45efb","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cda2f56ac699fd36","name":"stdout","source":"cda2f56ac699fd36.txt","type":"text/plain","size":2817}],"parameters":[],"hasContent":true,"stepsCount":30,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"837e4ce24ac45efb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/af543ced061d8858.json b/allure-report/data/test-cases/83b7eb2988572ef6.json similarity index 72% rename from allure-report/data/test-cases/af543ced061d8858.json rename to allure-report/data/test-cases/83b7eb2988572ef6.json index 3098a2c7343..25bbb11fc51 100644 --- a/allure-report/data/test-cases/af543ced061d8858.json +++ b/allure-report/data/test-cases/83b7eb2988572ef6.json @@ -1 +1 @@ -{"uid":"af543ced061d8858","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_26","historyId":"49ea03f1d04a92057a336da49714852c","time":{"start":1724733474522,"stop":1724733474522,"duration":0},"description":"\n 26 is not a square number\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b63774e9e6663cf7","name":"stdout","source":"b63774e9e6663cf7.txt","type":"text/plain","size":544}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"suite","value":"Games"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"CONTROL FLOW"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"dcb40cbe5ee38417.json","parameterValues":[]} \ No newline at end of file +{"uid":"85284c487c263073","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"554fb31ae5f3473b","name":"stdout","source":"554fb31ae5f3473b.txt","type":"text/plain","size":544}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"suite","value":"Games"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"CONTROL FLOW"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"85284c487c263073.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d7c1fb6f236110ca.json b/allure-report/data/test-cases/85b55023f525bac2.json similarity index 60% rename from allure-report/data/test-cases/d7c1fb6f236110ca.json rename to allure-report/data/test-cases/85b55023f525bac2.json index 74e4000e4bc..162695e504f 100644 --- a/allure-report/data/test-cases/d7c1fb6f236110ca.json +++ b/allure-report/data/test-cases/85b55023f525bac2.json @@ -1 +1 @@ -{"uid":"d7c1fb6f236110ca","name":"Testing number_of_sigfigs function","fullName":"kyu_7.significant_figures.test_number_of_sigfigs.NumberOfSigFigsTestCase#test_number_of_sigfigs","historyId":"3b2ebb1924dbc4e6a73dc5dda19dd323","time":{"start":1724735129242,"stop":1724735129242,"duration":0},"description":"\n Testing number_of_sigfigs function\n with various test inputs\n :return:\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"91ed862dacbec840","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"3edaeb1c9114b312","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ee4f0501c1152713.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"85df8de56a96ab7c","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"85df8de56a96ab7c.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/f711bbcd16ab2119.json b/allure-report/data/test-cases/863d9e582b6f3de4.json
similarity index 64%
rename from allure-report/data/test-cases/f711bbcd16ab2119.json
rename to allure-report/data/test-cases/863d9e582b6f3de4.json
index d93fe04b8b3..0350945206d 100644
--- a/allure-report/data/test-cases/f711bbcd16ab2119.json
+++ b/allure-report/data/test-cases/863d9e582b6f3de4.json
@@ -1 +1 @@
-{"uid":"f711bbcd16ab2119","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1724735127282,"stop":1724735127297,"duration":15},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9d173a5e0d4bb0c8","name":"stdout","source":"9d173a5e0d4bb0c8.txt","type":"text/plain","size":225}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Strip Comments"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1bbe34ba42279f71","status":"passed","time":{"start":1724733472421,"stop":1724733472437,"duration":16}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"5c64823a2a73f974","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"f711bbcd16ab2119.json","parameterValues":[]} \ No newline at end of file +{"uid":"863d9e582b6f3de4","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1724735127282,"stop":1724735127297,"duration":15},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"537ecc9a719af32f","name":"stdout","source":"537ecc9a719af32f.txt","type":"text/plain","size":225}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Strip Comments"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"863d9e582b6f3de4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8655885cb5db7a58.json b/allure-report/data/test-cases/8655885cb5db7a58.json deleted file mode 100644 index c47cfee1bae..00000000000 --- a/allure-report/data/test-cases/8655885cb5db7a58.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"8655885cb5db7a58","name":"Testing the 'group_cities' function","fullName":"kyu_6.rotate_the_letters_of_each_element.test_group_cities.GroupCitiesTestCase#test_group_cities","historyId":"0b146f7fbac52b042804286da8716f6b","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6968a83bd2f66f6","name":"stdout","source":"6968a83bd2f66f6.txt","type":"text/plain","size":1536}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b0ff51cf7a3c2781","status":"passed","time":{"start":1724733474054,"stop":1724733474054,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"578c3a6cd3e7e40f","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}}]},"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"8655885cb5db7a58.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ed37a80783d347db.json b/allure-report/data/test-cases/86b489ae6b8c1d23.json similarity index 68% rename from allure-report/data/test-cases/ed37a80783d347db.json rename to allure-report/data/test-cases/86b489ae6b8c1d23.json index 953a75296af..b80f1900f3d 100644 --- a/allure-report/data/test-cases/ed37a80783d347db.json +++ b/allure-report/data/test-cases/86b489ae6b8c1d23.json @@ -1 +1 @@ -{"uid":"ed37a80783d347db","name":"Large lists","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_large_list","historyId":"3b3f116ec3ac1abf551a51811b4a8900","time":{"start":1724733474632,"stop":1724733474647,"duration":15},"description":"\n Large lists\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472843,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472843,"stop":1724733472890,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472890,"stop":1724733472921,"duration":31},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4cd1e84a01209f22","name":"stdout","source":"4cd1e84a01209f22.txt","type":"text/plain","size":932}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OPTIMIZATION"},{"name":"feature","value":"Optimization"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Integers: Recreation One"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"2512233f29820ca9.json","parameterValues":[]} \ No newline at end of file +{"uid":"87c07388b10e55d5","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724733472796,"stop":1724733472921,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472843,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472843,"stop":1724733472890,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472890,"stop":1724733472921,"duration":31},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8fe3e8aa201d424a","name":"stdout","source":"8fe3e8aa201d424a.txt","type":"text/plain","size":932}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OPTIMIZATION"},{"name":"feature","value":"Optimization"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Integers: Recreation One"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"87c07388b10e55d5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9b0990a97652b0f6.json b/allure-report/data/test-cases/87d2fa2dfc5fe491.json similarity index 78% rename from allure-report/data/test-cases/9b0990a97652b0f6.json rename to allure-report/data/test-cases/87d2fa2dfc5fe491.json index ff6b0ac3b85..e1b92e2189d 100644 --- a/allure-report/data/test-cases/9b0990a97652b0f6.json +++ b/allure-report/data/test-cases/87d2fa2dfc5fe491.json @@ -1 +1 @@ -{"uid":"9b0990a97652b0f6","name":"Testing set_alarm function","fullName":"kyu_8.set_alarm.test_set_alarm.SetAlarmTestCase#test_set_alarm","historyId":"77c7125894dc4635fdd1db51405959d3","time":{"start":1724733474897,"stop":1724733474897,"duration":0},"description":"\n Testing set_alarm function with various test inputs.\n\n The function should return true if you are employed\n and not on vacation (because these are the circumstances\n under which you need to set an alarm). It should return\n false otherwise.\n\n Examples:\n\n setAlarm(true, true) -> false\n setAlarm(false, true) -> false\n setAlarm(false, false) -> false\n setAlarm(true, false) -> true\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1732428195501,"stop":1732428195501,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1732428195504,"stop":1732428195504,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4544ac5de6415953","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}},{"uid":"951576068e42ee36","status":"passed","time":{"start":1724733473944,"stop":1724733473944,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d9458c8615b9e985","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}},{"uid":"863d982a547ab48a","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"87dc5713a007f1d7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8804093a9c3b17d.json b/allure-report/data/test-cases/8804093a9c3b17d.json new file mode 100644 index 00000000000..e5dbc702226 --- /dev/null +++ b/allure-report/data/test-cases/8804093a9c3b17d.json @@ -0,0 +1 @@ +{"uid":"8804093a9c3b17d","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1732428193949,"stop":1732428193951,"duration":2},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1732428193949,"stop":1732428193949,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1732428193951,"stop":1732428193951,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CIPHERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"SECURITY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"bce82edab468d2f2","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"27b26e7a6523571a","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d9a6d590487a20fd","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"7e0e76f32ac7ce4e","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"8804093a9c3b17d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6ab6caccad49b468.json b/allure-report/data/test-cases/883f1439af050615.json similarity index 58% rename from allure-report/data/test-cases/6ab6caccad49b468.json rename to allure-report/data/test-cases/883f1439af050615.json index 4cc9536ee89..f03addd048c 100644 --- a/allure-report/data/test-cases/6ab6caccad49b468.json +++ b/allure-report/data/test-cases/883f1439af050615.json @@ -1 +1 @@ -{"uid":"6ab6caccad49b468","name":"Find the int that appears an odd number of times","fullName":"kyu_6.find_the_odd_int.test_find_the_odd_int.FindTheOddIntTestCase#test_something","historyId":"0f9fe14df4043e3026ded68af344e3f2","time":{"start":1724735128774,"stop":1724735128774,"duration":0},"description":"\n Sample testing.\n Expected result is 5\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bfa0e041a65d579a","name":"stdout","source":"bfa0e041a65d579a.txt","type":"text/plain","size":1380}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ASCII"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Character Encodings"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BINARY"},{"name":"tag","value":"FORMATS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["CHARACTER ENCODINGS","STRINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"8949506fce676285.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/898b5d5677e24adf.json b/allure-report/data/test-cases/898b5d5677e24adf.json new file mode 100644 index 00000000000..9acbe9106b2 --- /dev/null +++ b/allure-report/data/test-cases/898b5d5677e24adf.json @@ -0,0 +1 @@ +{"uid":"898b5d5677e24adf","name":"Testing 'order' function","fullName":"kyu_6.your_order_please.test_order.OrderTestCase#test_order","historyId":"337f8da3fccb836acfa7a9f697d95259","time":{"start":1732428195716,"stop":1732428195716,"duration":0},"description":"\n Your task is to verify that 'order' function\n sorts a given string by following rules:\n\n 1. Each word in the string will contain a single number.\n This number is the position the word should have in\n the result.\n\n 2. Note: Numbers can be from 1 to 9. So 1 will be the\n first word (not 0).\n\n 3. If the input string is empty, return an empty string.\n The words in the input String will only contain valid\n consecutive numbers.\n\n :return:\n ","descriptionHtml":"Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2143b544775b35fe","name":"stdout","source":"2143b544775b35fe.txt","type":"text/plain","size":601}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"a96041a690fcc058.json","parameterValues":[]} \ No newline at end of file +{"uid":"89c602359c6f109b","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f24a53f1fea24b32","name":"stdout","source":"f24a53f1fea24b32.txt","type":"text/plain","size":601}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"89c602359c6f109b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ddf52bfae3cd34f4.json b/allure-report/data/test-cases/8a9b52813983814b.json similarity index 74% rename from allure-report/data/test-cases/ddf52bfae3cd34f4.json rename to allure-report/data/test-cases/8a9b52813983814b.json index ece5c15a8c6..9a07e42ae15 100644 --- a/allure-report/data/test-cases/ddf52bfae3cd34f4.json +++ b/allure-report/data/test-cases/8a9b52813983814b.json @@ -1 +1 @@ -{"uid":"ddf52bfae3cd34f4","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"60ce0e41b02093a3","name":"stdout","source":"60ce0e41b02093a3.txt","type":"text/plain","size":348}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Who likes it?"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"ddf52bfae3cd34f4.json","parameterValues":[]} \ No newline at end of file +{"uid":"8a9b52813983814b","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5b8ca288b44682ec","name":"stdout","source":"5b8ca288b44682ec.txt","type":"text/plain","size":348}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Who likes it?"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"8a9b52813983814b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8b3214317e10e87f.json b/allure-report/data/test-cases/8b3214317e10e87f.json new file mode 100644 index 00000000000..3bd3f59298b --- /dev/null +++ b/allure-report/data/test-cases/8b3214317e10e87f.json @@ -0,0 +1 @@ +{"uid":"8b3214317e10e87f","name":"Testing number_of_sigfigs function","fullName":"kyu_7.significant_figures.test_number_of_sigfigs.NumberOfSigFigsTestCase#test_number_of_sigfigs","historyId":"3b2ebb1924dbc4e6a73dc5dda19dd323","time":{"start":1732428195953,"stop":1732428195953,"duration":0},"description":"\n Testing number_of_sigfigs function\n with various test inputs\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8ef3c2609186193","name":"stdout","source":"8ef3c2609186193.txt","type":"text/plain","size":23}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"8beabd2469a668.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7637c123d5cf58af.json b/allure-report/data/test-cases/8c6df3dc2deaaefa.json similarity index 70% rename from allure-report/data/test-cases/7637c123d5cf58af.json rename to allure-report/data/test-cases/8c6df3dc2deaaefa.json index 79e9929497c..1994bcc0393 100644 --- a/allure-report/data/test-cases/7637c123d5cf58af.json +++ b/allure-report/data/test-cases/8c6df3dc2deaaefa.json @@ -1 +1 @@ -{"uid":"7637c123d5cf58af","name":"Testing 'longest_repetition' function","fullName":"kyu_6.longest_repetition.test_longest_repetition.LongestRepetitionTestCase#test_longest_repetition","historyId":"6431e0366c9c302e03ac01343fb7ea77","time":{"start":1724733473976,"stop":1724733473976,"duration":0},"description":"\n For a given string s find the character c (or C) with\n longest consecutive repetition and return: (c, l)\n where l (or L) is the length of the repetition.\n\n For empty string return: ('', 0)\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"26c574f777b434b5","name":"stdout","source":"26c574f777b434b5.txt","type":"text/plain","size":213}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"story","value":"Sum of odd numbers"},{"name":"feature","value":"Math"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"a50af3a4d2a7afb5.json","parameterValues":[]} \ No newline at end of file +{"uid":"8c72192846448826","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cca44b266aa98436","name":"stdout","source":"cca44b266aa98436.txt","type":"text/plain","size":213}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"story","value":"Sum of odd numbers"},{"name":"feature","value":"Math"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"8c72192846448826.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9b4ada0bf1630c0a.json b/allure-report/data/test-cases/8c7db5518444ac71.json similarity index 64% rename from allure-report/data/test-cases/9b4ada0bf1630c0a.json rename to allure-report/data/test-cases/8c7db5518444ac71.json index 4046abfe02a..1196408a727 100644 --- a/allure-report/data/test-cases/9b4ada0bf1630c0a.json +++ b/allure-report/data/test-cases/8c7db5518444ac71.json @@ -1 +1 @@ -{"uid":"9b4ada0bf1630c0a","name":"Testing encrypt_this function","fullName":"kyu_6.encrypt_this.test_encrypt_this.EncryptThisTestCase#test_encrypt_this","historyId":"69a156fb0b04999e58427537301412d4","time":{"start":1724733473889,"stop":1724733473905,"duration":16},"description":"\n Testing encrypt_this function\n :param self:\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d071752d20b95de3","name":"stdout","source":"d071752d20b95de3.txt","type":"text/plain","size":204}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"aefb4681bbbff0c9.json","parameterValues":[]} \ No newline at end of file +{"uid":"8cdb3386cf094e1f","name":"Testing dirReduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"519607e9e5d7219c","name":"stdout","source":"519607e9e5d7219c.txt","type":"text/plain","size":204}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"8cdb3386cf094e1f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/debf2b82465b0240.json b/allure-report/data/test-cases/8cf44bb18023836b.json similarity index 64% rename from allure-report/data/test-cases/debf2b82465b0240.json rename to allure-report/data/test-cases/8cf44bb18023836b.json index 0e2cca495d9..54603c805f4 100644 --- a/allure-report/data/test-cases/debf2b82465b0240.json +++ b/allure-report/data/test-cases/8cf44bb18023836b.json @@ -1 +1 @@ -{"uid":"debf2b82465b0240","name":"Testing digital_root function","fullName":"kyu_6.sum_of_digits_digital_root.test_digital_root.DigitalRootTestCase#test_digital_root","historyId":"3d4d9d606fbf24bad8abb0f0f85e6130","time":{"start":1724735128961,"stop":1724735128961,"duration":0},"description":"\n In this kata, you must create a digital root function.\n\n A digital root is the recursive sum of all the digits\n in a number. Given n, take the sum of the digits of n.\n If that value has more than one digit, continue reducing\n in this way until a single-digit number is produced. This\n is only applicable to the natural numbers.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence\n types, the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"12ac45051c49f01a","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"d7eae685c38fccbb","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"ef7e94367cfcafa4","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"14e29fc6b385d9d8","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"8da01589d3299948.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/645c6c05562d2f01.json b/allure-report/data/test-cases/8dcfddf689f44d1d.json similarity index 66% rename from allure-report/data/test-cases/645c6c05562d2f01.json rename to allure-report/data/test-cases/8dcfddf689f44d1d.json index 22737961908..3d3b7d7afc6 100644 --- a/allure-report/data/test-cases/645c6c05562d2f01.json +++ b/allure-report/data/test-cases/8dcfddf689f44d1d.json @@ -1 +1 @@ -{"uid":"645c6c05562d2f01","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1a6c1f836394adf7","name":"stdout","source":"1a6c1f836394adf7.txt","type":"text/plain","size":562}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a51a382d521d00cc","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"34569132e9551c33","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"645c6c05562d2f01.json","parameterValues":[]} \ No newline at end of file +{"uid":"8dcfddf689f44d1d","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"678cdbc81118a45c","name":"stdout","source":"678cdbc81118a45c.txt","type":"text/plain","size":562}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"8dcfddf689f44d1d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8dde6031964dc28f.json b/allure-report/data/test-cases/8dde6031964dc28f.json new file mode 100644 index 00000000000..5e7d457253a --- /dev/null +++ b/allure-report/data/test-cases/8dde6031964dc28f.json @@ -0,0 +1 @@ +{"uid":"8dde6031964dc28f","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1732428193941,"stop":1732428193942,"duration":1},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1732428193941,"stop":1732428193941,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1732428193943,"stop":1732428193943,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"73a56012085cbb67","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"815ff7102e2d18bc","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"b1d54b76165521a0","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"164087ecc666d9a0","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"8dde6031964dc28f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6d9270ca3330737a.json b/allure-report/data/test-cases/8dea57e5544d4774.json similarity index 71% rename from allure-report/data/test-cases/6d9270ca3330737a.json rename to allure-report/data/test-cases/8dea57e5544d4774.json index 4e22bc34c2c..532c94c06d3 100644 --- a/allure-report/data/test-cases/6d9270ca3330737a.json +++ b/allure-report/data/test-cases/8dea57e5544d4774.json @@ -1 +1 @@ -{"uid":"6d9270ca3330737a","name":"OR logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_or","historyId":"ae9d861fd855b26fd2ffe303ebf8c238","time":{"start":1724733474819,"stop":1724733474819,"duration":0},"description":"\n In logic and mathematics, or is the\n truth-functional operator of (inclusive)\n disjunction, also known as alternation.\n\n The or of a set of operands is true if\n and only if one or more of its operands is true.\n\n Source:\n https://en.wikipedia.org/wiki/Logical_disjunction\n\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"22fcf1edf8ebf197.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"8efea6185ce9f545","name":"test_line_negative","fullName":"kyu_3.line_safari_is_that_a_line.test_line_negative.LineNegativeTestCase#test_line_negative","historyId":"e5c7abe0fcf3b79049d906f50808feb6","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Line Safari functionality\n Negative test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"8efea6185ce9f545.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/17d8ff61005bb0bc.json b/allure-report/data/test-cases/8f3fc2a4deaebd0d.json
similarity index 68%
rename from allure-report/data/test-cases/17d8ff61005bb0bc.json
rename to allure-report/data/test-cases/8f3fc2a4deaebd0d.json
index 538524e9b35..826204e272d 100644
--- a/allure-report/data/test-cases/17d8ff61005bb0bc.json
+++ b/allure-report/data/test-cases/8f3fc2a4deaebd0d.json
@@ -1 +1 @@
-{"uid":"17d8ff61005bb0bc","name":"Zero","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_zero","historyId":"e47953912bc73286c8a01ce448ee3c54","time":{"start":1724733474538,"stop":1724733474538,"duration":0},"description":"\n 0 is a square number\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"518d45d1073ca74","name":"stdout","source":"518d45d1073ca74.txt","type":"text/plain","size":263}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"90d2f619b6b55a93.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1edd352618c6aa2b.json b/allure-report/data/test-cases/910c497042fbb9d7.json similarity index 92% rename from allure-report/data/test-cases/1edd352618c6aa2b.json rename to allure-report/data/test-cases/910c497042fbb9d7.json index 772fb6750df..39f503ce3f8 100644 --- a/allure-report/data/test-cases/1edd352618c6aa2b.json +++ b/allure-report/data/test-cases/910c497042fbb9d7.json @@ -1 +1 @@ -{"uid":"1edd352618c6aa2b","name":"test_sequence","fullName":"kyu_6.no_arithmetic_progressions.test_sequence.SequenceTestCase#test_sequence","historyId":"4f7c4b258ce2dd212abc76d538a956bd","time":{"start":1724733473976,"stop":1724733473976,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_6\\\\no_arithmetic_progressions\\\\test_sequence.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"No arithmetic progressions"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.no_arithmetic_progressions.test_sequence"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0607115654a900140b3ce3/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"1edd352618c6aa2b.json","parameterValues":[]} \ No newline at end of file +{"uid":"910c497042fbb9d7","name":"test_sequence","fullName":"kyu_6.no_arithmetic_progressions.test_sequence.SequenceTestCase#test_sequence","historyId":"4f7c4b258ce2dd212abc76d538a956bd","time":{"start":1724733473976,"stop":1724733473976,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_6\\\\no_arithmetic_progressions\\\\test_sequence.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"No arithmetic progressions"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.no_arithmetic_progressions.test_sequence"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0607115654a900140b3ce3/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"910c497042fbb9d7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/91c9b008755c7351.json b/allure-report/data/test-cases/91c9b008755c7351.json new file mode 100644 index 00000000000..093a9481fe8 --- /dev/null +++ b/allure-report/data/test-cases/91c9b008755c7351.json @@ -0,0 +1 @@ +{"uid":"91c9b008755c7351","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1732428194039,"stop":1732428194040,"duration":1},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1732428194039,"stop":1732428194039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1732428194042,"stop":1732428194042,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"feature","value":"Validation"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5319ceacad5a43bc","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}},{"uid":"f7656bca6b03073b","status":"passed","time":{"start":1724733472437,"stop":1724733472437,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d6e4ebd44034ff08","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}},{"uid":"af3c309699fc2b8b","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}}]},"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"91c9b008755c7351.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/808471d4cfeae814.json b/allure-report/data/test-cases/920950efadf9f044.json similarity index 67% rename from allure-report/data/test-cases/808471d4cfeae814.json rename to allure-report/data/test-cases/920950efadf9f044.json index 8529819f92f..266f6f1c304 100644 --- a/allure-report/data/test-cases/808471d4cfeae814.json +++ b/allure-report/data/test-cases/920950efadf9f044.json @@ -1 +1 @@ -{"uid":"808471d4cfeae814","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"92552b4b1fe49529","name":"stdout","source":"92552b4b1fe49529.txt","type":"text/plain","size":253}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"808471d4cfeae814.json","parameterValues":[]} \ No newline at end of file +{"uid":"920950efadf9f044","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7e0608ae57e6ca33","name":"stdout","source":"7e0608ae57e6ca33.txt","type":"text/plain","size":253}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"920950efadf9f044.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b0ff51cf7a3c2781.json b/allure-report/data/test-cases/924a52587e7b2c82.json similarity index 68% rename from allure-report/data/test-cases/b0ff51cf7a3c2781.json rename to allure-report/data/test-cases/924a52587e7b2c82.json index 6f06abd3180..28537f22042 100644 --- a/allure-report/data/test-cases/b0ff51cf7a3c2781.json +++ b/allure-report/data/test-cases/924a52587e7b2c82.json @@ -1 +1 @@ -{"uid":"b0ff51cf7a3c2781","name":"Testing the 'group_cities' function","fullName":"kyu_6.rotate_the_letters_of_each_element.test_group_cities.GroupCitiesTestCase#test_group_cities","historyId":"0b146f7fbac52b042804286da8716f6b","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"108fa13d4dc4aeec","name":"stdout","source":"108fa13d4dc4aeec.txt","type":"text/plain","size":1536}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Lists"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"LISTS"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"b0ff51cf7a3c2781.json","parameterValues":[]} \ No newline at end of file +{"uid":"924a52587e7b2c82","name":"Testing the 'group_cities' function","fullName":"kyu_6.rotate_the_letters_of_each_element.test_group_cities.GroupCitiesTestCase#test_group_cities","historyId":"0b146f7fbac52b042804286da8716f6b","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2e5a8277ac6080e3","name":"stdout","source":"2e5a8277ac6080e3.txt","type":"text/plain","size":1536}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Lists"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"LISTS"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"924a52587e7b2c82.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9267ea7150c527ef.json b/allure-report/data/test-cases/9267ea7150c527ef.json new file mode 100644 index 00000000000..fbd8edba102 --- /dev/null +++ b/allure-report/data/test-cases/9267ea7150c527ef.json @@ -0,0 +1 @@ +{"uid":"9267ea7150c527ef","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"description":"\n Testing stock_list function with various test data\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1732428195509,"stop":1732428195510,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing stock_list function with various test data\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1732428195512,"stop":1732428195512,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"602b6b1c829f1e7f","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}},{"uid":"9ee9ff331756b11e","status":"passed","time":{"start":1724733473960,"stop":1724733473960,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"1719ddf6913445c8","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}},{"uid":"66511dda8143933e","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"9267ea7150c527ef.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/92a7ecb29f4704b1.json b/allure-report/data/test-cases/92a7ecb29f4704b1.json new file mode 100644 index 00000000000..a6b647d51eb --- /dev/null +++ b/allure-report/data/test-cases/92a7ecb29f4704b1.json @@ -0,0 +1 @@ +{"uid":"92a7ecb29f4704b1","name":"Test that no_space function removes the spaces","fullName":"kyu_8.remove_string_spaces.test_remove_string_spaces.NoSpaceTestCase#test_something","historyId":"8069a1b5a4342457d2dabf5819382a2e","time":{"start":1732428196352,"stop":1732428196352,"duration":0},"description":"\n Test that no_space function removes the spaces\n from the string, then return the resultant string.\n :return:\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"db194e9e67e4f8fb","name":"stdout","source":"db194e9e67e4f8fb.txt","type":"text/plain","size":428}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Factorial"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"4979ee3063a87441.json","parameterValues":[]} \ No newline at end of file +{"uid":"9348c64cc78f5d13","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9b1bb88dc50af4ea","name":"stdout","source":"9b1bb88dc50af4ea.txt","type":"text/plain","size":428}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Factorial"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"9348c64cc78f5d13.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/56a28cc490d83b65.json b/allure-report/data/test-cases/937c9b1e748aadb0.json similarity index 57% rename from allure-report/data/test-cases/56a28cc490d83b65.json rename to allure-report/data/test-cases/937c9b1e748aadb0.json index 890844e8de4..84ad7af05b2 100644 --- a/allure-report/data/test-cases/56a28cc490d83b65.json +++ b/allure-report/data/test-cases/937c9b1e748aadb0.json @@ -1 +1 @@ -{"uid":"56a28cc490d83b65","name":"Test with empty string","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_empty","historyId":"2af6aa545c98eb65f8404392b6468813","time":{"start":1724735129649,"stop":1724735129649,"duration":0},"description":"\n Test with empty string\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9a93b35004a87c6a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"e5ac2209dd79eabb","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"1dee8c06fd165199.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"945a96aedc88e8fe","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"945a96aedc88e8fe.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/23b523b580f78123.json b/allure-report/data/test-cases/94af9200e69d147a.json
similarity index 79%
rename from allure-report/data/test-cases/23b523b580f78123.json
rename to allure-report/data/test-cases/94af9200e69d147a.json
index 6883b226109..86a0b877d03 100644
--- a/allure-report/data/test-cases/23b523b580f78123.json
+++ b/allure-report/data/test-cases/94af9200e69d147a.json
@@ -1 +1 @@
-{"uid":"23b523b580f78123","name":"Testing check_root function","fullName":"kyu_7.always_perfect.test_check_root.CheckRootTestCase#test_check_root","historyId":"9c2d30046a2fe35ee19c9d3833ea20a5","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"description":"\n Testing check_root function with various test inputs\n\n A function which takes numbers separated by commas\n in string format and returns the number which is a\n perfect square and the square root of that number.\n\n If string contains other characters than number or\n it has more or less than 4 numbers separated by comma\n function returns \"incorrect input\".\n\n If string contains 4 numbers but not consecutive it\n returns \"not consecutive\".\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"1c3fe0844baefb8c","name":"stdout","source":"1c3fe0844baefb8c.txt","type":"text/plain","size":717}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":0,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"a9f33e581ec48813.json","parameterValues":[]} \ No newline at end of file +{"uid":"951576068e42ee36","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"34515415abccae34","name":"stdout","source":"34515415abccae34.txt","type":"text/plain","size":717}],"parameters":[],"hasContent":true,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"951576068e42ee36.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/95172229a5a9ad6.json b/allure-report/data/test-cases/95172229a5a9ad6.json deleted file mode 100644 index d14c13033eb..00000000000 --- a/allure-report/data/test-cases/95172229a5a9ad6.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"95172229a5a9ad6","name":"'fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"92e60d573610c20c","name":"stdout","source":"92e60d573610c20c.txt","type":"text/plain","size":611}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"95172229a5a9ad6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9521eb418a2faa99.json b/allure-report/data/test-cases/9521eb418a2faa99.json new file mode 100644 index 00000000000..64b7ce1e6d4 --- /dev/null +++ b/allure-report/data/test-cases/9521eb418a2faa99.json @@ -0,0 +1 @@ +{"uid":"9521eb418a2faa99","name":"Testing 'solution' function","fullName":"kyu_7.pull_your_words_together_man.test_sentencify.SentencifyTestCase#test_sentencify","historyId":"5821e6355bce2a3bf46d4ce3e55de034","time":{"start":1732428195914,"stop":1732428195914,"duration":0},"description":"\n Testing 'sentencify' function.\n The function should:\n 1. Capitalise the first letter of the first word.\n 2. Add a period (.) to the end of the sentence.\n 3. Join the words into a complete string, with spaces.\n 4. Do no other manipulation on the words.\n\n :return:\n ","descriptionHtml":"Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"suite","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Potion Class 101"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"5e4b4c0a3aeae99e.json","parameterValues":[]} \ No newline at end of file +{"uid":"95a29a9545c416cd","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"suite","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Potion Class 101"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"95a29a9545c416cd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/95ddc175910ea52.json b/allure-report/data/test-cases/95ddc175910ea52.json deleted file mode 100644 index 958a182617b..00000000000 --- a/allure-report/data/test-cases/95ddc175910ea52.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"95ddc175910ea52","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2fa0f7a126ad592b","name":"stdout","source":"2fa0f7a126ad592b.txt","type":"text/plain","size":1009}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Snail"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7b9876690035f17","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"16026a681cee6bae","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}}]},"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"95ddc175910ea52.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/95e612b16602c749.json b/allure-report/data/test-cases/95e612b16602c749.json deleted file mode 100644 index 4f2c5b0f31a..00000000000 --- a/allure-report/data/test-cases/95e612b16602c749.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"95e612b16602c749","name":"Testing Calculator class","fullName":"kyu_3.calculator.test_calculator.CalculatorTestCase#test_calculator","historyId":"939a8064e3d28ec85fadd67010b560ae","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Calculator class\n A simple calculator that given a string of operators '()', '+', '-', '*', '/'\n and numbers separated by spaces will return the value of that expression\n\n :return: None\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4cfe45f98e3a162","name":"stdout","source":"4cfe45f98e3a162.txt","type":"text/plain","size":524}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Diagonal"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"431c7499a8a042ca","status":"passed","time":{"start":1724733473218,"stop":1724733473889,"duration":671}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7f2ec06c200d3086","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"964ad50f448ed64d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a2fbd8f640be4431.json b/allure-report/data/test-cases/965a3663c8644328.json similarity index 73% rename from allure-report/data/test-cases/a2fbd8f640be4431.json rename to allure-report/data/test-cases/965a3663c8644328.json index 4817087afe3..4aff28c166b 100644 --- a/allure-report/data/test-cases/a2fbd8f640be4431.json +++ b/allure-report/data/test-cases/965a3663c8644328.json @@ -1 +1 @@ -{"uid":"a2fbd8f640be4431","name":"a and b are equal","fullName":"kyu_7.disemvowel_trolls.test_disemvowel_trolls.DisemvowelTestCase#test_disemvowel","historyId":"4171a558a2bea15b5a0546d36c9a1c63","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"description":"\n The string \"This website is for losers LOL!\"\n should become \"Ths wbst s fr lsrs LL!\"\n :return:\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d7e0ef7caf28d559","name":"stdout","source":"d7e0ef7caf28d559.txt","type":"text/plain","size":878}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"761811e55728ed74","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"3fa15071b1bee987","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"8a76fd0002a5824c.json","parameterValues":[]} \ No newline at end of file +{"uid":"97ad1cd914697b30","name":"Testing Encoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding.EncodingTestCase#test_encoding","historyId":"195b2d3cd638502ec301b9e9eaa3f969","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"857a5351e31f1baf","name":"stdout","source":"857a5351e31f1baf.txt","type":"text/plain","size":878}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"97ad1cd914697b30.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9800852f4c3c1957.json b/allure-report/data/test-cases/9800852f4c3c1957.json new file mode 100644 index 00000000000..e77f66edb65 --- /dev/null +++ b/allure-report/data/test-cases/9800852f4c3c1957.json @@ -0,0 +1 @@ +{"uid":"9800852f4c3c1957","name":"Testing check_exam function","fullName":"kyu_8.check_the_exam.test_check_exam.CheckExamTestCase#test_check_exam","historyId":"ed6c1e5f0eb38874fc66b7fa53f68e12","time":{"start":1732428196110,"stop":1732428196110,"duration":0},"description":"\n Testing check_exam function\n\n The function should return the score\n for this array of answers, giving +4\n for each correct answer, -1 for each\n incorrect answer, and +0 for each blank\n answer(empty string).\n\n :return:\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 37, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"445f2e59cb6a4191","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"8efea6185ce9f545","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"88c7e92ae3f035ea","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"620b2589fb870406","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"996ab105867adbc9.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/2965d2d3db0ea08e.json b/allure-report/data/test-cases/997065a61e801d4c.json
similarity index 65%
rename from allure-report/data/test-cases/2965d2d3db0ea08e.json
rename to allure-report/data/test-cases/997065a61e801d4c.json
index 4918d27313a..8f330320d63 100644
--- a/allure-report/data/test-cases/2965d2d3db0ea08e.json
+++ b/allure-report/data/test-cases/997065a61e801d4c.json
@@ -1 +1 @@
-{"uid":"2965d2d3db0ea08e","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6f54ca69ed4a797e","name":"stdout","source":"6f54ca69ed4a797e.txt","type":"text/plain","size":931}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sum of Pairs"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"MEMOIZATION"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"feature","value":"Memoization"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"895ce9b19a080b91","status":"passed","time":{"start":1724733472999,"stop":1724733472999,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"be5a8376fdcba717","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}}]},"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"2965d2d3db0ea08e.json","parameterValues":[]} \ No newline at end of file +{"uid":"997065a61e801d4c","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2dd75c6915b1e704","name":"stdout","source":"2dd75c6915b1e704.txt","type":"text/plain","size":931}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sum of Pairs"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"MEMOIZATION"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"feature","value":"Memoization"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"997065a61e801d4c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a93bd997ced3859a.json b/allure-report/data/test-cases/99b8e6f5f8a43508.json similarity index 62% rename from allure-report/data/test-cases/a93bd997ced3859a.json rename to allure-report/data/test-cases/99b8e6f5f8a43508.json index 7503f9f09c4..99f51597b36 100644 --- a/allure-report/data/test-cases/a93bd997ced3859a.json +++ b/allure-report/data/test-cases/99b8e6f5f8a43508.json @@ -1 +1 @@ -{"uid":"a93bd997ced3859a","name":"Testing 'numericals' function","fullName":"kyu_6.numericals_of_string.test_numericals.NumericalsTestCase#test_numericals","historyId":"d2b4dccd0eb8dfd6ef62ac0349f0f6a7","time":{"start":1724733473991,"stop":1724733474007,"duration":16},"description":"\n Testing 'numericals' function\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"839e0167efc9a3e5","name":"stdout","source":"839e0167efc9a3e5.txt","type":"text/plain","size":434}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"204251456ada0752","status":"passed","time":{"start":1724733475038,"stop":1724733475038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"928532982127bba0","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"35cf25b9e515e00d.json","parameterValues":[]} \ No newline at end of file +{"uid":"99ca7a938f9d4989","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ca908a3276ec1f33","name":"stdout","source":"ca908a3276ec1f33.txt","type":"text/plain","size":434}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"99ca7a938f9d4989.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dbd8c0e7d9b1bcd0.json b/allure-report/data/test-cases/9a401d5b28fee66a.json similarity index 74% rename from allure-report/data/test-cases/dbd8c0e7d9b1bcd0.json rename to allure-report/data/test-cases/9a401d5b28fee66a.json index 5371b9bf405..a0776b70fdd 100644 --- a/allure-report/data/test-cases/dbd8c0e7d9b1bcd0.json +++ b/allure-report/data/test-cases/9a401d5b28fee66a.json @@ -1 +1 @@ -{"uid":"dbd8c0e7d9b1bcd0","name":"Testing compute_ranks","fullName":"kyu_5.sports_league_table_ranking.test_compute_ranks.ComputeRanksTestCase#test_something","historyId":"21739eee721a124a84e5414945df03e6","time":{"start":1724733472983,"stop":1724733472983,"duration":0},"description":"\n Test the function that organizes a sports league in a\n round-robin-system. Each team meets all other teams.\n In your league a win gives a team 2 points, a draw gives\n both teams 1 point. After some games you have to compute\n the order of the teams in your league. You use the following\n criteria to arrange the teams:\n\n - Points\n - Scoring differential (the difference between goals scored and those conceded)\n - Goals scored\n\n :return:\n ","descriptionHtml":"Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"27155577e4b86a95","name":"stdout","source":"27155577e4b86a95.txt","type":"text/plain","size":277}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAY"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"e41551e078ed42ea.json","parameterValues":[]} \ No newline at end of file +{"uid":"9abe86e868e9efe6","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3d8fef51a9e30706","name":"stdout","source":"3d8fef51a9e30706.txt","type":"text/plain","size":277}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAY"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"9abe86e868e9efe6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d5a389260d41a743.json b/allure-report/data/test-cases/9ac6d40036941792.json similarity index 58% rename from allure-report/data/test-cases/d5a389260d41a743.json rename to allure-report/data/test-cases/9ac6d40036941792.json index 9740d2276c3..38510786d0a 100644 --- a/allure-report/data/test-cases/d5a389260d41a743.json +++ b/allure-report/data/test-cases/9ac6d40036941792.json @@ -1 +1 @@ -{"uid":"d5a389260d41a743","name":"Should return 'Publish!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_publish","historyId":"b4a1fa278aa899a374ebad09960e6cca","time":{"start":1724735129711,"stop":1724735129711,"duration":0},"description":"\n If there are one or two good ideas,\n return 'Publish!',\n :return:\n ","descriptionHtml":"The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1732428196335,"stop":1732428196335,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing fix_the_meerkat function with various test data\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1732428196337,"stop":1732428196337,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"My head is at the wrong end!"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"73db1f36a5925004","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}},{"uid":"acf49fc01f491be4","status":"passed","time":{"start":1724733474850,"stop":1724733474850,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"deed80da6e08bd69","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}},{"uid":"1152e12f582a6d83","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}}]},"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"9c241cc9403723af.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/675849fee1009391.json b/allure-report/data/test-cases/9c2fc5bac7417dd0.json similarity index 58% rename from allure-report/data/test-cases/675849fee1009391.json rename to allure-report/data/test-cases/9c2fc5bac7417dd0.json index e04ffc867b1..1291c78d9f5 100644 --- a/allure-report/data/test-cases/675849fee1009391.json +++ b/allure-report/data/test-cases/9c2fc5bac7417dd0.json @@ -1 +1 @@ -{"uid":"675849fee1009391","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fec67c535945138b","name":"stdout","source":"fec67c535945138b.txt","type":"text/plain","size":67}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cabe377ec9af3c98","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"c1f2317d20109e13","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"675849fee1009391.json","parameterValues":[]} \ No newline at end of file +{"uid":"9c2fc5bac7417dd0","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d0b96f0ad42d1de6","name":"stdout","source":"d0b96f0ad42d1de6.txt","type":"text/plain","size":67}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"9c2fc5bac7417dd0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b5a45493f51c1d67.json b/allure-report/data/test-cases/9c43e0c7813423da.json similarity index 55% rename from allure-report/data/test-cases/b5a45493f51c1d67.json rename to allure-report/data/test-cases/9c43e0c7813423da.json index bbe8d28b5dd..a0b734da766 100644 --- a/allure-report/data/test-cases/b5a45493f51c1d67.json +++ b/allure-report/data/test-cases/9c43e0c7813423da.json @@ -1 +1 @@ -{"uid":"b5a45493f51c1d67","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Append the list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"93547fa89048aa2f","name":"stdout","source":"93547fa89048aa2f.txt","type":"text/plain","size":261}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f90c5e53432ea6c2","status":"passed","time":{"start":1724733473139,"stop":1724733473139,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7f890ca68cdfc481","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"b5a45493f51c1d67.json","parameterValues":[]} \ No newline at end of file +{"uid":"9c43e0c7813423da","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Append the list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c77e43a426f47681","name":"stdout","source":"c77e43a426f47681.txt","type":"text/plain","size":261}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"9c43e0c7813423da.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9c5c32029e742eac.json b/allure-report/data/test-cases/9c5c32029e742eac.json new file mode 100644 index 00000000000..89534607581 --- /dev/null +++ b/allure-report/data/test-cases/9c5c32029e742eac.json @@ -0,0 +1 @@ +{"uid":"9c5c32029e742eac","name":"All chars are in lower case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_all_lower","historyId":"124f2add699f3e2269c311afae219c6e","time":{"start":1732428194603,"stop":1732428194603,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in lower case\n :return:\n ","descriptionHtml":"Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1732428193958,"stop":1732428193958,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1732428193961,"stop":1732428193961,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CIPHERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"SECURITY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"97ad1cd914697b30","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"54e4671ce8499dcf","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"8a76fd0002a5824c","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"3fa15071b1bee987","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"9dd5714486b51753.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8c975897c57d974e.json b/allure-report/data/test-cases/9e6f93dfe778ff9a.json similarity index 69% rename from allure-report/data/test-cases/8c975897c57d974e.json rename to allure-report/data/test-cases/9e6f93dfe778ff9a.json index a34aed00ca8..0e340495bd1 100644 --- a/allure-report/data/test-cases/8c975897c57d974e.json +++ b/allure-report/data/test-cases/9e6f93dfe778ff9a.json @@ -1 +1 @@ -{"uid":"8c975897c57d974e","name":"Testing litres function with various test inputs","fullName":"kyu_8.keep_hydrated.test_keep_hydrated.KeepHydratedTestCase#test_keep_hydrated","historyId":"d2c9cdacf9fca346eec2858cd44275e6","time":{"start":1724733474788,"stop":1724733474788,"duration":0},"description":"\n Testing litres function with various test inputs\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b8fb66a095ff9819","name":"stdout","source":"b8fb66a095ff9819.txt","type":"text/plain","size":1127}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Help the bookseller !"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"abba91be3722688b.json","parameterValues":[]} \ No newline at end of file +{"uid":"9ee9ff331756b11e","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"419d7e1cf9a3c9b","name":"stdout","source":"419d7e1cf9a3c9b.txt","type":"text/plain","size":1127}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Help the bookseller !"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"9ee9ff331756b11e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9f02852e3aa10b6d.json b/allure-report/data/test-cases/9f02852e3aa10b6d.json new file mode 100644 index 00000000000..31eab43797e --- /dev/null +++ b/allure-report/data/test-cases/9f02852e3aa10b6d.json @@ -0,0 +1 @@ +{"uid":"9f02852e3aa10b6d","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Insert items to the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3f23fd2a44d74bcb","name":"stdout","source":"3f23fd2a44d74bcb.txt","type":"text/plain","size":261}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"9f02852e3aa10b6d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/39ba63dd42027b29.json b/allure-report/data/test-cases/9f8b999462605375.json similarity index 74% rename from allure-report/data/test-cases/39ba63dd42027b29.json rename to allure-report/data/test-cases/9f8b999462605375.json index 4de8f3c0ec9..68b26d75f4a 100644 --- a/allure-report/data/test-cases/39ba63dd42027b29.json +++ b/allure-report/data/test-cases/9f8b999462605375.json @@ -1 +1 @@ -{"uid":"39ba63dd42027b29","name":"Testing string_transformer function","fullName":"kyu_6.string_transformer.test_string_transformer.StringTransformerTestCase#test_string_transformer","historyId":"05d3d7ae3b11057af82404f162aa30df","time":{"start":1724733474101,"stop":1724733474101,"duration":0},"description":"\n Testing string_transformer function\n with multiple test data.\n\n Given a string, return a new string that has\n transformed based on the input:\n\n 1. Change case of every character, ie. lower\n case to upper case, upper case to lower case.\n\n 2. Reverse the order of words from the input.\n\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1732428194123,"stop":1732428194123,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1732428194125,"stop":1732428194125,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1732428194125,"stop":1732428194125,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"AGGREGATIONS"},{"name":"feature","value":"Aggregations"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"39376204dc517df6","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}},{"uid":"ed566371d87065db","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"e03974f538ea8ee6","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}},{"uid":"acc95e26a53d92ff","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}}]},"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"9f9422c1f71252b6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/280a7287fd39d5a9.json b/allure-report/data/test-cases/9fa9266ff3a1c464.json similarity index 64% rename from allure-report/data/test-cases/280a7287fd39d5a9.json rename to allure-report/data/test-cases/9fa9266ff3a1c464.json index 8410d1ee7e5..0bd731032d4 100644 --- a/allure-report/data/test-cases/280a7287fd39d5a9.json +++ b/allure-report/data/test-cases/9fa9266ff3a1c464.json @@ -1 +1 @@ -{"uid":"280a7287fd39d5a9","name":"test_basic","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_basic","historyId":"81b718c3bba361637ce9ed2266cd30d2","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5b1486b52334c41e","name":"stdout","source":"5b1486b52334c41e.txt","type":"text/plain","size":222}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"f80f9bf6821c7c25","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"280a7287fd39d5a9.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"9fa9266ff3a1c464","name":"test_basic","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_basic","historyId":"81b718c3bba361637ce9ed2266cd30d2","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"16b3d133c1b1141f","name":"stdout","source":"16b3d133c1b1141f.txt","type":"text/plain","size":222}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"280a7287fd39d5a9","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}},{"uid":"f80f9bf6821c7c25","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"9fa9266ff3a1c464.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a492d74df14be54a.json b/allure-report/data/test-cases/a076808e43574371.json
similarity index 63%
rename from allure-report/data/test-cases/a492d74df14be54a.json
rename to allure-report/data/test-cases/a076808e43574371.json
index eb86245ee10..f5a17b61689 100644
--- a/allure-report/data/test-cases/a492d74df14be54a.json
+++ b/allure-report/data/test-cases/a076808e43574371.json
@@ -1 +1 @@
-{"uid":"a492d74df14be54a","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c144733a0318ce29","name":"stdout","source":"c144733a0318ce29.txt","type":"text/plain","size":242}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"90a114379d845ff7","status":"passed","time":{"start":1724733474288,"stop":1724733474288,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"c11bd2bbb0f17cd9","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"a492d74df14be54a.json","parameterValues":[]} \ No newline at end of file +{"uid":"a076808e43574371","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"65c05475b72ce468","name":"stdout","source":"65c05475b72ce468.txt","type":"text/plain","size":242}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c7eea171ede7ee13","status":"passed","time":{"start":1724733474288,"stop":1724733474288,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"a492d74df14be54a","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}},{"uid":"c11bd2bbb0f17cd9","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"a076808e43574371.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/327fbdea3443aca5.json b/allure-report/data/test-cases/a0d455d6bf21528b.json similarity index 63% rename from allure-report/data/test-cases/327fbdea3443aca5.json rename to allure-report/data/test-cases/a0d455d6bf21528b.json index af90a5bdf75..ebf9801dd25 100644 --- a/allure-report/data/test-cases/327fbdea3443aca5.json +++ b/allure-report/data/test-cases/a0d455d6bf21528b.json @@ -1 +1 @@ -{"uid":"327fbdea3443aca5","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7dbffa484c49e1de","name":"stdout","source":"7dbffa484c49e1de.txt","type":"text/plain","size":230}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b0f9b8de2eb00fed","status":"passed","time":{"start":1724733474725,"stop":1724733474725,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"c301f45b01d7d10f","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"327fbdea3443aca5.json","parameterValues":[]} \ No newline at end of file +{"uid":"a0d455d6bf21528b","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ffe9d790c546ddb7","name":"stdout","source":"ffe9d790c546ddb7.txt","type":"text/plain","size":230}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"a0d455d6bf21528b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a10876da94fb2b4f.json b/allure-report/data/test-cases/a10876da94fb2b4f.json new file mode 100644 index 00000000000..4ab83e44eac --- /dev/null +++ b/allure-report/data/test-cases/a10876da94fb2b4f.json @@ -0,0 +1 @@ +{"uid":"a10876da94fb2b4f","name":"You are given two angles -> find the 3rd.","fullName":"kyu_8.third_angle_of_triangle.test_third_angle_of_triangle.OtherAngleTestCase#test_other_angle","historyId":"6630066bed88b9c8246478bc4b94ac73","time":{"start":1732428196417,"stop":1732428196418,"duration":1},"description":"\n You are given two angles (in degrees) of a triangle.\n Find the 3rd.\n :return:\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"f4ad45627654b5fc.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"a1b53b199c1c867e","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a1b53b199c1c867e.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a224a931a5567f85.json b/allure-report/data/test-cases/a224a931a5567f85.json
new file mode 100644
index 00000000000..382325ebc62
--- /dev/null
+++ b/allure-report/data/test-cases/a224a931a5567f85.json
@@ -0,0 +1 @@
+{"uid":"a224a931a5567f85","name":"Testing 'shortest_job_first(' function","fullName":"kyu_6.scheduling.test_solution.SJFTestCase#test_sjf","historyId":"da4a41f0bf9943ee34282e89227dd9a2","time":{"start":1732428195625,"stop":1732428195626,"duration":1},"description":"\n Testing 'shortest_job_first' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of jobs and returns a positive integer representing the cc ittakes to complete the job at index.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SJFTestCase","time":{"start":1732428195625,"stop":1732428195625,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'shortest_job_first' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of jobs and returns a positive integer representing the cc ittakes to complete the job at index.
","status":"passed","steps":[{"name":"Enter a n (([0], 0)) and verify the expected output (100) vs actual result (100)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 10, 20, 0, 0], 0)) and verify the expected output (6) vs actual result (6)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 0, 20, 0, 0], 1)) and verify the expected output (16) vs actual result (16)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 0, 10, 20, 0, 0], 1)) and verify the expected output (16) vs actual result (16)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 0, 0, 20, 0, 0], 2)) and verify the expected output (26) vs actual result (26)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([20, 20, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 19, 0, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 20, 0, 19, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 18, 0, 0], 75)) and verify the expected output (1008) vs actual result (1008)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 13, 13, 12, 17, 0, 15, 0, 12, 0, 15, 0, 0, 12, 19, 11, 10, 0, 11, 18, 0, 0, 15, 20, 0, 16, 12, 17, 0, 0, 10, 19, 0, 9, 0, 16, 19, 16, 15, 0, 17, 0, 13, 11, 19, 18, 13, 10, 0, 20, 0, 10, 9, 18, 14, 18, 0, 15, 17, 10, 17, 0, 0, 0, 18, 0, 0, 19, 14, 0, 0, 19, 19, 0, 0, 0, 0, 0, 9, 18, 0, 0, 11, 16, 0, 0, 0, 0, 10, 0, 17, 0, 16, 0, 0, 0, 16, 0, 13, 20, 0, 20, 20, 0, 0, 20, 14, 0, 11, 0, 9, 0, 0, 20, 11, 17, 0, 12, 13, 16, 13, 19, 0, 18, 20, 0, 19, 10, 19, 12, 0, 18, 0, 14, 9, 0, 0, 0, 13, 14, 9, 18, 9, 11, 19, 10, 20, 17, 13, 0, 13, 0, 12, 0, 19, 0, 14, 0, 20, 0, 14, 12, 11, 18, 0, 0, 9, 0, 19], 24)) and verify the expected output (275) vs actual result (275)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SJFTestCase::0","time":{"start":1732428195628,"stop":1732428195628,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"QUEUES"},{"name":"story","value":"Scheduling (Shortest Job First or SJF)"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"SCHEDULING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.scheduling.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550cc572b9e7b563be00054f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"tags":["SCHEDULING","QUEUES","ALGORITHMS"]},"source":"a224a931a5567f85.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ac127c4c71bf788d.json b/allure-report/data/test-cases/a258a6f00a3ffda1.json similarity index 70% rename from allure-report/data/test-cases/ac127c4c71bf788d.json rename to allure-report/data/test-cases/a258a6f00a3ffda1.json index 356fd8346dc..8fd6a029bc7 100644 --- a/allure-report/data/test-cases/ac127c4c71bf788d.json +++ b/allure-report/data/test-cases/a258a6f00a3ffda1.json @@ -1 +1 @@ -{"uid":"ac127c4c71bf788d","name":"Find the int that appears an odd number of times","fullName":"kyu_6.find_the_odd_int.test_find_the_odd_int.FindTheOddIntTestCase#test_something","historyId":"0f9fe14df4043e3026ded68af344e3f2","time":{"start":1724733473913,"stop":1724733473913,"duration":0},"description":"\n Sample testing.\n Expected result is 5\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an un-existing item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d920f200ffe2c729","name":"stdout","source":"d920f200ffe2c729.txt","type":"text/plain","size":378}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ef7cb2e79441187e","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"a33fb2570aec1823","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"99a050e28b9f808c.json","parameterValues":[]} \ No newline at end of file +{"uid":"a2cc2be21cb9d7cd","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an un-existing item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2b6038e2de6e977a","name":"stdout","source":"2b6038e2de6e977a.txt","type":"text/plain","size":378}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"a2cc2be21cb9d7cd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9a93b35004a87c6a.json b/allure-report/data/test-cases/a3216b951d3fac8b.json similarity index 94% rename from allure-report/data/test-cases/9a93b35004a87c6a.json rename to allure-report/data/test-cases/a3216b951d3fac8b.json index 9a74bf00f7a..2e104875721 100644 --- a/allure-report/data/test-cases/9a93b35004a87c6a.json +++ b/allure-report/data/test-cases/a3216b951d3fac8b.json @@ -1 +1 @@ -{"uid":"9a93b35004a87c6a","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"9a93b35004a87c6a.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"a3216b951d3fac8b","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a3216b951d3fac8b.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a3370192ce6dd676.json b/allure-report/data/test-cases/a3370192ce6dd676.json
new file mode 100644
index 00000000000..158bb275ec2
--- /dev/null
+++ b/allure-report/data/test-cases/a3370192ce6dd676.json
@@ -0,0 +1 @@
+{"uid":"a3370192ce6dd676","name":"String with no alphabet chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_no_alpha","historyId":"eb9123a4aa86a26d4fdbf67e2370745f","time":{"start":1732428195488,"stop":1732428195488,"duration":0},"description":"\n Test string with no alphabet chars.\n :return:\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1732428194005,"stop":1732428194005,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1732428194006,"stop":1732428194006,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1732428194006,"stop":1732428194006,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1732428194007,"stop":1732428194007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1732428194009,"stop":1732428194009,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f63a88604b1d062f","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"89c602359c6f109b","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"f80099cf6c294d2b","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"99f691b62c390084","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"a3395496d8bde803.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a349732eb44f62b9.json b/allure-report/data/test-cases/a349732eb44f62b9.json new file mode 100644 index 00000000000..5ae1056b924 --- /dev/null +++ b/allure-report/data/test-cases/a349732eb44f62b9.json @@ -0,0 +1 @@ +{"uid":"a349732eb44f62b9","name":"Testing 'solution' function","fullName":"kyu_7.substituting_variables_into_strings_padded_numbers.test_solution.SolutionTestCase#test_solution","historyId":"fbdd2daae3e9a5e6dd05fcb0403a88d1","time":{"start":1732428195982,"stop":1732428195982,"duration":0},"description":"\n The function should return a formatted string.\n The return value should equal \"Value is VALUE\"\n where value is a 5 digit padded number.\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1732428196232,"stop":1732428196232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Greek Sort"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a0d455d6bf21528b","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"c6f52d0b9e8ac3c5","status":"passed","time":{"start":1724733474725,"stop":1724733474725,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"327fbdea3443aca5","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"c301f45b01d7d10f","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"a4849e99633e4676.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a4b7cb6ba7726224.json b/allure-report/data/test-cases/a4b7cb6ba7726224.json deleted file mode 100644 index 4249097126e..00000000000 --- a/allure-report/data/test-cases/a4b7cb6ba7726224.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"a4b7cb6ba7726224","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1724733473171,"stop":1724733473186,"duration":15},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Remove items from the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3b4c7e69e73ca20","name":"stdout","source":"3b4c7e69e73ca20.txt","type":"text/plain","size":254}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"a4b7cb6ba7726224.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a4f7c6dc4c7e84.json b/allure-report/data/test-cases/a4f7c6dc4c7e84.json deleted file mode 100644 index a1e3ca8f032..00000000000 --- a/allure-report/data/test-cases/a4f7c6dc4c7e84.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"a4f7c6dc4c7e84","name":"Testing 'vaporcode' function","fullName":"kyu_7.vaporcode.test_vaporcode.VaporcodeTestCase#test_vaporcode","historyId":"91791ed1a852f76f936407ccb3d2dbaa","time":{"start":1724733474507,"stop":1724733474507,"duration":0},"description":"\n Testing 'vaporcode' function\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1c7070c159aacf2e","name":"stdout","source":"1c7070c159aacf2e.txt","type":"text/plain","size":326}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"8f884e4fa29bb7d4.json","parameterValues":[]} \ No newline at end of file +{"uid":"a530698ca5ed066c","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1905a023fe62d7a5","name":"stdout","source":"1905a023fe62d7a5.txt","type":"text/plain","size":326}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"a530698ca5ed066c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a57a3497f4402b67.json b/allure-report/data/test-cases/a57a3497f4402b67.json new file mode 100644 index 00000000000..f9bb8fa212d --- /dev/null +++ b/allure-report/data/test-cases/a57a3497f4402b67.json @@ -0,0 +1 @@ +{"uid":"a57a3497f4402b67","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1732428194185,"stop":1732428194185,"duration":0},"description":"\n Testing using basic test data\n :return:\n ","descriptionHtml":" Testing using basic test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"deff2de3f9ed88f5","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"e47ebce66bbb53cd","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"d6d51bdb700f78e3","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"ad08cb0fb6eef203","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a57a3497f4402b67.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a7008d20e58a9d6a.json b/allure-report/data/test-cases/a7008d20e58a9d6a.json
new file mode 100644
index 00000000000..53cc0931e6f
--- /dev/null
+++ b/allure-report/data/test-cases/a7008d20e58a9d6a.json
@@ -0,0 +1 @@
+{"uid":"a7008d20e58a9d6a","name":"You are given two angles -> find the 3rd.","fullName":"kyu_8.third_angle_of_triangle.test_third_angle_of_triangle.OtherAngleTestCase#test_other_angle","historyId":"6630066bed88b9c8246478bc4b94ac73","time":{"start":1724733474944,"stop":1724733474944,"duration":0},"description":"\n You are given two angles (in degrees) of a triangle.\n Find the 3rd.\n :return:\n ","descriptionHtml":"Testing position property based on negative grids.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":true,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":"Testing position property based on negative grids.
","status":"passed","steps":[{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase::0","time":{"start":1732428193935,"stop":1732428193935,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"3c0afff932465669","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"30b1174850b5a822","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":1,"unknown":0,"total":3},"items":[{"uid":"801bdccb4e1aa824","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"92b17e5074e54ef7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"a76c277b6c0b5940.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a770e6ac7d91604a.json b/allure-report/data/test-cases/a770e6ac7d91604a.json new file mode 100644 index 00000000000..70212a30c1c --- /dev/null +++ b/allure-report/data/test-cases/a770e6ac7d91604a.json @@ -0,0 +1 @@ +{"uid":"a770e6ac7d91604a","name":"Testing 'save' function: positive","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_positive","historyId":"b1ff2214ba100eb1c8bc62e73e12889e","time":{"start":1732428195810,"stop":1732428195810,"duration":0},"description":"\n Testing 'save' function: positive\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"eba58defe547aa99","name":"stdout","source":"eba58defe547aa99.txt","type":"text/plain","size":565}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"922eccc2ca8ed714.json","parameterValues":[]} \ No newline at end of file +{"uid":"a7d4500da5fb8933","name":"Testing next_smaller function","fullName":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller.NextSmallerTestCase#test_next_smaller","historyId":"9d8cb8adf1764c55348d349698b938ac","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e0673a9df06bdbef","name":"stdout","source":"e0673a9df06bdbef.txt","type":"text/plain","size":565}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"a7d4500da5fb8933.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bc5cb7d257f882a1.json b/allure-report/data/test-cases/a8b77a6618ff7e4c.json similarity index 94% rename from allure-report/data/test-cases/bc5cb7d257f882a1.json rename to allure-report/data/test-cases/a8b77a6618ff7e4c.json index 26d8ba99672..a895f3dad63 100644 --- a/allure-report/data/test-cases/bc5cb7d257f882a1.json +++ b/allure-report/data/test-cases/a8b77a6618ff7e4c.json @@ -1 +1 @@ -{"uid":"bc5cb7d257f882a1","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Josephus Survivor"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"bc5cb7d257f882a1.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"a8b77a6618ff7e4c","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Josephus Survivor"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a8b77a6618ff7e4c.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a8ef326c3cb7b77c.json b/allure-report/data/test-cases/a8ef326c3cb7b77c.json
new file mode 100644
index 00000000000..c560816e9f1
--- /dev/null
+++ b/allure-report/data/test-cases/a8ef326c3cb7b77c.json
@@ -0,0 +1 @@
+{"uid":"a8ef326c3cb7b77c","name":"a and b are equal","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_equal_numbers","historyId":"2972663ca9fa4b4f0e6ea69060a464d5","time":{"start":1724733474179,"stop":1724733474179,"duration":0},"description":"\n a and b are equal\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1732428194117,"stop":1732428194117,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7e5150fbd4a33237","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}},{"uid":"49fb68289fb078f8","status":"passed","time":{"start":1724733472452,"stop":1724733472499,"duration":47}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"82619e3fb0e84d4d","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}},{"uid":"521b14729542d5c4","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}}]},"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"aa08a95162404297.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/aa3ebaa27581f198.json b/allure-report/data/test-cases/aa3ebaa27581f198.json new file mode 100644 index 00000000000..1986ca57797 --- /dev/null +++ b/allure-report/data/test-cases/aa3ebaa27581f198.json @@ -0,0 +1 @@ +{"uid":"aa3ebaa27581f198","name":"Testing make_upper_case function","fullName":"kyu_8.make_upper_case.test_make_upper_case.MakeUpperCaseTestCase#test_make_upper_case","historyId":"9fe496d12a67f53b3208a0b823f2d8c3","time":{"start":1732428196321,"stop":1732428196321,"duration":0},"description":"\n Sample Tests for make_upper_case function\n :return:\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1732428194134,"stop":1732428194134,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ddd928ac3a4fb635","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}},{"uid":"f1d39787f3312e8b","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d558fd9b3bcee4ae","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}},{"uid":"6ce4bba2ff4664c2","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"ac136a3215f7ad6c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ac379271ec16d5ad.json b/allure-report/data/test-cases/ac379271ec16d5ad.json new file mode 100644 index 00000000000..f74b3c602e0 --- /dev/null +++ b/allure-report/data/test-cases/ac379271ec16d5ad.json @@ -0,0 +1 @@ +{"uid":"ac379271ec16d5ad","name":"Testing 'parts_sums' function","fullName":"kyu_6.sums_of_parts.test_solution.PartsSumTestCase#test_parts_sum","historyId":"570c0d220c13fc0fd061240afc68e35d","time":{"start":1732428195683,"stop":1732428195683,"duration":0},"description":"\n Testing 'parts_sums' function with various test data\n :return:\n ","descriptionHtml":"Test a function that take as parameter a list ls and return a list of the sums of its parts as defined below:
ls = [1, 2, 3, 4, 5, 6]
parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]
Test a function that take as parameter a list ls and return a list of the sums of its parts as defined below:
ls = [1, 2, 3, 4, 5, 6]
parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]
Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f8b4598a501c7d27","name":"stdout","source":"f8b4598a501c7d27.txt","type":"text/plain","size":502}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"6fce95111dc1cc14.json","parameterValues":[]} \ No newline at end of file +{"uid":"ac81c5ec86387239","name":"Testing array_diff function","fullName":"kyu_6.array_diff.test_array_diff.ArrayDiffTestCase#test_array_diff_function","historyId":"5e365f66b39a2fede4fe18a5cc569699","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7d49bbac8d757852","name":"stdout","source":"7d49bbac8d757852.txt","type":"text/plain","size":502}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"ac81c5ec86387239.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ac8683bc2703e398.json b/allure-report/data/test-cases/ac8683bc2703e398.json new file mode 100644 index 00000000000..f67aeba0744 --- /dev/null +++ b/allure-report/data/test-cases/ac8683bc2703e398.json @@ -0,0 +1 @@ +{"uid":"ac8683bc2703e398","name":"Test with one char only","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_one_char","historyId":"e3d629a995491cb3a3079998a04583ff","time":{"start":1732428196369,"stop":1732428196369,"duration":0},"description":"\n Test with one char only\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c258bec5b6c8eafe","name":"stdout","source":"c258bec5b6c8eafe.txt","type":"text/plain","size":611}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"acf49fc01f491be4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1b8dc3acaf7dd027.json b/allure-report/data/test-cases/acfebfd078f8e03c.json similarity index 72% rename from allure-report/data/test-cases/1b8dc3acaf7dd027.json rename to allure-report/data/test-cases/acfebfd078f8e03c.json index 7518cc12392..68835673fcc 100644 --- a/allure-report/data/test-cases/1b8dc3acaf7dd027.json +++ b/allure-report/data/test-cases/acfebfd078f8e03c.json @@ -1 +1 @@ -{"uid":"1b8dc3acaf7dd027","name":"Testing 'save' function: negative","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_negative","historyId":"eb89ee17d2b7a29796b27ce5ba503de6","time":{"start":1724733474241,"stop":1724733474241,"duration":0},"description":"\n Testing 'save' function: negative\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"91ed862dacbec840.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"af4da168bd187f62","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"af4da168bd187f62.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/af82a0c3b0cef265.json b/allure-report/data/test-cases/af82a0c3b0cef265.json
new file mode 100644
index 00000000000..98a27ef3993
--- /dev/null
+++ b/allure-report/data/test-cases/af82a0c3b0cef265.json
@@ -0,0 +1 @@
+{"uid":"af82a0c3b0cef265","name":"Testing the 'solution' function","fullName":"kyu_6.multiples_of_3_or_5.test_solution.SolutionTestCase#test_solution","historyId":"c387db789a67b80c29f3c3ba2e6c9bce","time":{"start":1732428195530,"stop":1732428195531,"duration":1},"description":"\n Testing solution function\n\n If we list all the natural numbers below 10\n that are multiples of 3 or 5, we get 3, 5, 6 and 9.\n The sum of these multiples is 23.\n\n Finish the solution so that it returns the sum of\n all the multiples of 3 or 5 below the number passed in.\n\n Note: If the number is a multiple of both 3 and 5,\n only count it once.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fb14be3959747375","name":"stdout","source":"fb14be3959747375.txt","type":"text/plain","size":562}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"a51a382d521d00cc.json","parameterValues":[]} \ No newline at end of file +{"uid":"b080152571ac4adf","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d85ac6726b459082","name":"stdout","source":"d85ac6726b459082.txt","type":"text/plain","size":562}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"b080152571ac4adf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b29b4bc1c1fe7917.json b/allure-report/data/test-cases/b169e974f5edace2.json similarity index 66% rename from allure-report/data/test-cases/b29b4bc1c1fe7917.json rename to allure-report/data/test-cases/b169e974f5edace2.json index 6056bfc17c4..deb7f693c5f 100644 --- a/allure-report/data/test-cases/b29b4bc1c1fe7917.json +++ b/allure-report/data/test-cases/b169e974f5edace2.json @@ -1 +1 @@ -{"uid":"b29b4bc1c1fe7917","name":"Testing valid_parentheses function","fullName":"kyu_5.valid_parentheses.test_valid_parentheses.ValidParenthesesTestCase#test_valid_parentheses","historyId":"92164414ad94bf1f5638230345fa606d","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"description":"\n Test the function called that takes a string of parentheses,\n and determines if the order of the parentheses is valid.\n The function should return true if the string is valid,\n and false if it's invalid.\n\n Examples\n\n \"()\" => true\n \")(()))\" => false\n \"(\" => false\n \"(())((()())())\" => true\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e11dfdc5beea1549","name":"stdout","source":"e11dfdc5beea1549.txt","type":"text/plain","size":524}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Diagonal"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"b1f2cc8e1be032d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b2705032891531e8.json b/allure-report/data/test-cases/b2705032891531e8.json new file mode 100644 index 00000000000..6ab9972060d --- /dev/null +++ b/allure-report/data/test-cases/b2705032891531e8.json @@ -0,0 +1 @@ +{"uid":"b2705032891531e8","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1732428196453,"stop":1732428196455,"duration":2},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1732428196456,"stop":1732428196456,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Will you make it?"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f040925d9e513197","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}},{"uid":"6f0b2af516b0f755","status":"passed","time":{"start":1724733474975,"stop":1724733474975,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"afae2f3faef55f2b","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}},{"uid":"627a7fd2fe38a284","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"b2705032891531e8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b2ea4d6d64dc027a.json b/allure-report/data/test-cases/b2ea4d6d64dc027a.json new file mode 100644 index 00000000000..840c7cc7e54 --- /dev/null +++ b/allure-report/data/test-cases/b2ea4d6d64dc027a.json @@ -0,0 +1 @@ +{"uid":"b2ea4d6d64dc027a","name":"Find the int that appears an odd number of times","fullName":"kyu_6.find_the_odd_int.test_find_the_odd_int.FindTheOddIntTestCase#test_something","historyId":"0f9fe14df4043e3026ded68af344e3f2","time":{"start":1732428195466,"stop":1732428195466,"duration":0},"description":"\n Sample testing.\n :return:\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3d05ca7bd9d20192","name":"stdout","source":"3d05ca7bd9d20192.txt","type":"text/plain","size":931}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MEMOIZATION"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"895ce9b19a080b91.json","parameterValues":[]} \ No newline at end of file +{"uid":"b4abfaf3d77f3f23","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a881d3345681241e","name":"stdout","source":"a881d3345681241e.txt","type":"text/plain","size":931}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MEMOIZATION"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"b4abfaf3d77f3f23.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b5a113fbe50e74ce.json b/allure-report/data/test-cases/b5a113fbe50e74ce.json new file mode 100644 index 00000000000..030444d5fbf --- /dev/null +++ b/allure-report/data/test-cases/b5a113fbe50e74ce.json @@ -0,0 +1 @@ +{"uid":"b5a113fbe50e74ce","name":"test_solution_empty","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_empty","historyId":"29249ea89f0081dda70899f3290f857b","time":{"start":1732428194194,"stop":1732428194194,"duration":0},"description":"\n Testing using empty test data\n :return:\n ","descriptionHtml":" Testing using empty test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 108, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7131237025069abe","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"37f24af32c057862","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"39245131d70863d6","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"c322e80c6cd8da83","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"b5a113fbe50e74ce.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/b6301a55868859d.json b/allure-report/data/test-cases/b6301a55868859d.json
deleted file mode 100644
index 77388e947cd..00000000000
--- a/allure-report/data/test-cases/b6301a55868859d.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"b6301a55868859d","name":"Testing 'summation' function","fullName":"kyu_8.grasshopper_summation.test_summation.SummationTestCase#test_summation","historyId":"44ae966390833a332245c1886323c559","time":{"start":1724735129508,"stop":1724735129508,"duration":0},"description":"\n Testing summation function\n with various test inputs\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196250,"stop":1732428196250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c74e320818fb9682","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}},{"uid":"5f2df3f2c9b86d77","status":"passed","time":{"start":1724733474757,"stop":1724733474757,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"cde5d1b46b10d7ac","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}},{"uid":"f5a3f0d4d035c3a4","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"b67813f1cae4659e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/337891d8027fbc46.json b/allure-report/data/test-cases/b67b48d7bd01382a.json similarity index 58% rename from allure-report/data/test-cases/337891d8027fbc46.json rename to allure-report/data/test-cases/b67b48d7bd01382a.json index cab89a7138e..d917a2be1f2 100644 --- a/allure-report/data/test-cases/337891d8027fbc46.json +++ b/allure-report/data/test-cases/b67b48d7bd01382a.json @@ -1 +1 @@ -{"uid":"337891d8027fbc46","name":"String with no alphabet chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_no_alpha","historyId":"eb9123a4aa86a26d4fdbf67e2370745f","time":{"start":1724735128789,"stop":1724735128789,"duration":0},"description":"\n Test string with no alphabet chars\n :return:\n ","descriptionHtml":" A function f(n), should returns the n-th member of sequence.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_6\\\\no_arithmetic_progressions\\\\test_sequence.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"No arithmetic progressions"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.no_arithmetic_progressions.test_sequence"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0607115654a900140b3ce3","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c6eafeb1b2d72c83","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}},{"uid":"910c497042fbb9d7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733473976,"stop":1724733473976,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"b72d4e8ad3288d1b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}},{"uid":"900ed6bd99df3d56","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}}]},"tags":["ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"b6d0f7b70ff35380.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/b7243d74fc99fb8b.json b/allure-report/data/test-cases/b7243d74fc99fb8b.json
new file mode 100644
index 00000000000..1b0556e258c
--- /dev/null
+++ b/allure-report/data/test-cases/b7243d74fc99fb8b.json
@@ -0,0 +1 @@
+{"uid":"b7243d74fc99fb8b","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1732428193918,"stop":1732428193918,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ef1a5cba4efb343a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"a1b53b199c1c867e","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"cf3552eb00513a1a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"f4c5ff18f0370583","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"b7243d74fc99fb8b.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/59ab6d9b07f441c0.json b/allure-report/data/test-cases/b7812824440b717e.json
similarity index 67%
rename from allure-report/data/test-cases/59ab6d9b07f441c0.json
rename to allure-report/data/test-cases/b7812824440b717e.json
index e3208d46d6c..b7860921b81 100644
--- a/allure-report/data/test-cases/59ab6d9b07f441c0.json
+++ b/allure-report/data/test-cases/b7812824440b717e.json
@@ -1 +1 @@
-{"uid":"59ab6d9b07f441c0","name":"Two smallest numbers in the start of the list","fullName":"kyu_7.sum_of_two_lowest_int.test_sum_two_smallest_numbers.SumTwoSmallestNumbersTestCase#test_sum_two_smallest_numbers","historyId":"429c2bf738c7d46e53c9a2e5226d6649","time":{"start":1724733474491,"stop":1724733474507,"duration":16},"description":"\n Test sum_two_smallest_numbers function\n The function should return the sum of\n the two lowest positive numbers\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e11ad2661eb07ca9","name":"stdout","source":"e11ad2661eb07ca9.txt","type":"text/plain","size":1093}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Disease Spread"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d757011cc42c205e","status":"passed","time":{"start":1724733473186,"stop":1724733473186,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"b3f7088fed8dedd7","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"c1e0648976f6a694.json","parameterValues":[]} \ No newline at end of file +{"uid":"b890a6fea083097f","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e7750817bf2ce3d3","name":"stdout","source":"e7750817bf2ce3d3.txt","type":"text/plain","size":1093}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Disease Spread"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"b890a6fea083097f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b897401968bf0d8.json b/allure-report/data/test-cases/b897401968bf0d8.json new file mode 100644 index 00000000000..8513cf733b6 --- /dev/null +++ b/allure-report/data/test-cases/b897401968bf0d8.json @@ -0,0 +1 @@ +{"uid":"b897401968bf0d8","name":"Zero","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_zero","historyId":"e47953912bc73286c8a01ce448ee3c54","time":{"start":1732428196084,"stop":1732428196084,"duration":0},"description":"\n 0 is a square number\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c931c8cfab53b972","name":"stdout","source":"c931c8cfab53b972.txt","type":"text/plain","size":243}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"11b4e7794c00f220.json","parameterValues":[]} \ No newline at end of file +{"uid":"b921129ad79b857f","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f329250c4d2cb198","name":"stdout","source":"f329250c4d2cb198.txt","type":"text/plain","size":243}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"b921129ad79b857f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7511d5ab976a748a.json b/allure-report/data/test-cases/b982073aac2c9d08.json similarity index 61% rename from allure-report/data/test-cases/7511d5ab976a748a.json rename to allure-report/data/test-cases/b982073aac2c9d08.json index 6d560aa76dc..770c5535b1f 100644 --- a/allure-report/data/test-cases/7511d5ab976a748a.json +++ b/allure-report/data/test-cases/b982073aac2c9d08.json @@ -1 +1 @@ -{"uid":"7511d5ab976a748a","name":"Testing increment_string function","fullName":"kyu_5.string_incrementer.test_increment_string.StringIncrementerTestCase#test_increment_string","historyId":"5d0f5e220c2579103119e57300b46215","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"description":"\n Testing a function named increment_string\n\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c6d99744fc651725","name":"stdout","source":"c6d99744fc651725.txt","type":"text/plain","size":2817}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":30,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"GAMES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a97caba53074497b","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"a921030da8c9a520","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}}]},"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"7f90afc62f8400f4.json","parameterValues":[]} \ No newline at end of file +{"uid":"b9ab4feb44c59984","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1bfd50f00e4c2ad5","name":"stdout","source":"1bfd50f00e4c2ad5.txt","type":"text/plain","size":2817}],"parameters":[],"hasContent":true,"stepsCount":30,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"GAMES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"b9ab4feb44c59984.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b9b6a14fc4bd1dd7.json b/allure-report/data/test-cases/b9b6a14fc4bd1dd7.json new file mode 100644 index 00000000000..251074db408 --- /dev/null +++ b/allure-report/data/test-cases/b9b6a14fc4bd1dd7.json @@ -0,0 +1 @@ +{"uid":"b9b6a14fc4bd1dd7","name":"Test with empty string","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_empty","historyId":"2af6aa545c98eb65f8404392b6468813","time":{"start":1732428196364,"stop":1732428196364,"duration":0},"description":"\n Test with empty string\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"10bda13bc4365ba8","name":"stdout","source":"10bda13bc4365ba8.txt","type":"text/plain","size":1515}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":13,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Human readable duration format"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"d5804044d1767680.json","parameterValues":[]} \ No newline at end of file +{"uid":"bc039aea1f276c5c","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e1db63f604b55e53","name":"stdout","source":"e1db63f604b55e53.txt","type":"text/plain","size":1515}],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Human readable duration format"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"bc039aea1f276c5c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bcc8c6b28fb32dd0.json b/allure-report/data/test-cases/bcc8c6b28fb32dd0.json new file mode 100644 index 00000000000..69db19b3ebd --- /dev/null +++ b/allure-report/data/test-cases/bcc8c6b28fb32dd0.json @@ -0,0 +1 @@ +{"uid":"bcc8c6b28fb32dd0","name":"Testing string_transformer function","fullName":"kyu_6.string_transformer.test_string_transformer.StringTransformerTestCase#test_string_transformer","historyId":"05d3d7ae3b11057af82404f162aa30df","time":{"start":1732428195666,"stop":1732428195666,"duration":0},"description":"\n Testing string_transformer function\n with multiple test data.\n\n Given a string, return a new string that has\n transformed based on the input:\n\n 1. Change case of every character, ie. lower\n case to upper case, upper case to lower case.\n\n 2. Reverse the order of words from the input.\n\n :return:\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"25c7546e6e88bf29","name":"stdout","source":"25c7546e6e88bf29.txt","type":"text/plain","size":530}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"58ec93395b112a8f","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"7e0e76f32ac7ce4e","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"d9a6d590487a20fd.json","parameterValues":[]} \ No newline at end of file +{"uid":"bce82edab468d2f2","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"282ef4a825ddd5b7","name":"stdout","source":"282ef4a825ddd5b7.txt","type":"text/plain","size":530}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"bce82edab468d2f2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bd11ee5929c6c53a.json b/allure-report/data/test-cases/bd11ee5929c6c53a.json new file mode 100644 index 00000000000..ce5e4796cb0 --- /dev/null +++ b/allure-report/data/test-cases/bd11ee5929c6c53a.json @@ -0,0 +1 @@ +{"uid":"bd11ee5929c6c53a","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied\n by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied\n by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1732428193903,"stop":1732428193903,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"tag","value":"VALIDATION"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"49355004a4136993","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}},{"uid":"56ae9013352b7649","status":"passed","time":{"start":1724733472296,"stop":1724733472296,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"5dad026541a05e65","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}},{"uid":"36b9e5073b489f49","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}}]},"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"bd11ee5929c6c53a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bd4541daca134967.json b/allure-report/data/test-cases/bd4541daca134967.json new file mode 100644 index 00000000000..00f4830c445 --- /dev/null +++ b/allure-report/data/test-cases/bd4541daca134967.json @@ -0,0 +1 @@ +{"uid":"bd4541daca134967","name":"XOR logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_xor","historyId":"80fa996da1344642e95c3c1d2f315df1","time":{"start":1732428196311,"stop":1732428196312,"duration":1},"description":"\n Exclusive or or exclusive disjunction is a\n logical operation that outputs true only when\n inputs differ (one is true, the other is false).\n\n XOR outputs true whenever the inputs differ:\n\n Source:\n https://en.wikipedia.org/wiki/Exclusive_or\n :return:\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e9b85a28a1d1502","name":"stdout","source":"e9b85a28a1d1502.txt","type":"text/plain","size":3097}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"PARSING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"RANKING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"feature","value":"String"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"be618dffc8aac711.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bfd2093ec920e131.json b/allure-report/data/test-cases/be628f1c5b8245e1.json similarity index 71% rename from allure-report/data/test-cases/bfd2093ec920e131.json rename to allure-report/data/test-cases/be628f1c5b8245e1.json index 38b510f7e12..f5110870b61 100644 --- a/allure-report/data/test-cases/bfd2093ec920e131.json +++ b/allure-report/data/test-cases/be628f1c5b8245e1.json @@ -1 +1 @@ -{"uid":"bfd2093ec920e131","name":"Testing check_for_factor function: positive flow","fullName":"kyu_8.grasshopper_check_for_factor.test_check_for_factor.CheckForFactorTestCase#test_check_for_factor_false","historyId":"8c287dae332df512fc4a9755020ffedc","time":{"start":1724733474679,"stop":1724733474694,"duration":15},"description":"\n Testing check_for_factor function.\n\n This function should test if the\n factor is a factor of base.\n\n Return false if it is not a factor.\n :return:\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
Testing using big test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 70, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f11813f80ada0713","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"3aa67525242f5614","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"a6bf4a932c1ec147","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"6827fd264cb4d263","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c42292a9c36c46f3.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/b8b1a20b1ac22e64.json b/allure-report/data/test-cases/c4304a318e243c50.json
similarity index 57%
rename from allure-report/data/test-cases/b8b1a20b1ac22e64.json
rename to allure-report/data/test-cases/c4304a318e243c50.json
index e5545a20ff9..f5bd6c58bea 100644
--- a/allure-report/data/test-cases/b8b1a20b1ac22e64.json
+++ b/allure-report/data/test-cases/c4304a318e243c50.json
@@ -1 +1 @@
-{"uid":"b8b1a20b1ac22e64","name":"String alphabet chars and spaces","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_space","historyId":"11acd8f3802b43ce2264b83840d495b4","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"description":"\n Repeating char is a space\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests").\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2b5d1a28c2e7859f","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}},{"uid":"3c944fe792fcd179","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472765,"stop":1724733472765,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"c37dfc82a096ec09","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}},{"uid":"257a5ad111bd69a7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}}]},"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c58cb7ae6e5a9993.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/f90c5e53432ea6c2.json b/allure-report/data/test-cases/c5ea93b10613ec53.json
similarity index 66%
rename from allure-report/data/test-cases/f90c5e53432ea6c2.json
rename to allure-report/data/test-cases/c5ea93b10613ec53.json
index 94db8bf2c5e..81be1eb0c2c 100644
--- a/allure-report/data/test-cases/f90c5e53432ea6c2.json
+++ b/allure-report/data/test-cases/c5ea93b10613ec53.json
@@ -1 +1 @@
-{"uid":"f90c5e53432ea6c2","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Append the list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f18b0e548340aa4f","name":"stdout","source":"f18b0e548340aa4f.txt","type":"text/plain","size":261}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"f90c5e53432ea6c2.json","parameterValues":[]} \ No newline at end of file +{"uid":"c5ea93b10613ec53","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Append the list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4143349f87c576ac","name":"stdout","source":"4143349f87c576ac.txt","type":"text/plain","size":261}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"c5ea93b10613ec53.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2460353038ce1955.json b/allure-report/data/test-cases/c5f3069d223f82c6.json similarity index 57% rename from allure-report/data/test-cases/2460353038ce1955.json rename to allure-report/data/test-cases/c5f3069d223f82c6.json index fb5f844f441..4ef8a2af8dd 100644 --- a/allure-report/data/test-cases/2460353038ce1955.json +++ b/allure-report/data/test-cases/c5f3069d223f82c6.json @@ -1 +1 @@ -{"uid":"2460353038ce1955","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b7bfbf78e894e0ca","name":"stdout","source":"b7bfbf78e894e0ca.txt","type":"text/plain","size":882}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"55d1d73293e16236","status":"passed","time":{"start":1724733472421,"stop":1724733472421,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"afdaa298aab7eba8","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"2460353038ce1955.json","parameterValues":[]} \ No newline at end of file +{"uid":"c5f3069d223f82c6","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6dccc5ff56326cce","name":"stdout","source":"6dccc5ff56326cce.txt","type":"text/plain","size":882}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"c5f3069d223f82c6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e21dc9fd5c9ffdad.json b/allure-report/data/test-cases/c6923016c0d7805e.json similarity index 59% rename from allure-report/data/test-cases/e21dc9fd5c9ffdad.json rename to allure-report/data/test-cases/c6923016c0d7805e.json index fcfcfb28d92..e3eb1c4a2a6 100644 --- a/allure-report/data/test-cases/e21dc9fd5c9ffdad.json +++ b/allure-report/data/test-cases/c6923016c0d7805e.json @@ -1 +1 @@ -{"uid":"e21dc9fd5c9ffdad","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have Dog arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 5 arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have good arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 50lb arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have brown arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4f8b5b6368092f66","name":"stdout","source":"4f8b5b6368092f66.txt","type":"text/plain","size":148}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Make Class"},{"name":"parentSuite","value":"Beginner"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"e21dc9fd5c9ffdad.json","parameterValues":[]} \ No newline at end of file +{"uid":"c6923016c0d7805e","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have Dog arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 5 arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have good arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 50lb arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have brown arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"50b324c74021da7c","name":"stdout","source":"50b324c74021da7c.txt","type":"text/plain","size":148}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Make Class"},{"name":"parentSuite","value":"Beginner"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"c6923016c0d7805e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b72d4e8ad3288d1b.json b/allure-report/data/test-cases/c6eafeb1b2d72c83.json similarity index 61% rename from allure-report/data/test-cases/b72d4e8ad3288d1b.json rename to allure-report/data/test-cases/c6eafeb1b2d72c83.json index 7297e2735ff..1a7b38b75ae 100644 --- a/allure-report/data/test-cases/b72d4e8ad3288d1b.json +++ b/allure-report/data/test-cases/c6eafeb1b2d72c83.json @@ -1 +1 @@ -{"uid":"b72d4e8ad3288d1b","name":"test_sequence","fullName":"kyu_6.no_arithmetic_progressions.test_sequence.SequenceTestCase#test_sequence","historyId":"4f7c4b258ce2dd212abc76d538a956bd","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_6\\\\no_arithmetic_progressions\\\\test_sequence.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"No arithmetic progressions"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.no_arithmetic_progressions.test_sequence"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0607115654a900140b3ce3/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1edd352618c6aa2b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733473976,"stop":1724733473976,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"900ed6bd99df3d56","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}}]},"tags":["ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"b72d4e8ad3288d1b.json","parameterValues":[]} \ No newline at end of file +{"uid":"c6eafeb1b2d72c83","name":"test_sequence","fullName":"kyu_6.no_arithmetic_progressions.test_sequence.SequenceTestCase#test_sequence","historyId":"4f7c4b258ce2dd212abc76d538a956bd","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_6\\\\no_arithmetic_progressions\\\\test_sequence.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"No arithmetic progressions"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.no_arithmetic_progressions.test_sequence"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0607115654a900140b3ce3/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c6eafeb1b2d72c83.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b0f9b8de2eb00fed.json b/allure-report/data/test-cases/c6f52d0b9e8ac3c5.json similarity index 72% rename from allure-report/data/test-cases/b0f9b8de2eb00fed.json rename to allure-report/data/test-cases/c6f52d0b9e8ac3c5.json index c06f343b0ff..c292f81dd96 100644 --- a/allure-report/data/test-cases/b0f9b8de2eb00fed.json +++ b/allure-report/data/test-cases/c6f52d0b9e8ac3c5.json @@ -1 +1 @@ -{"uid":"b0f9b8de2eb00fed","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"67735b58dfb8e3b0","name":"stdout","source":"67735b58dfb8e3b0.txt","type":"text/plain","size":230}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"feature","value":"Tuple"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"b0f9b8de2eb00fed.json","parameterValues":[]} \ No newline at end of file +{"uid":"c6f52d0b9e8ac3c5","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"dd90e5bd6518035b","name":"stdout","source":"dd90e5bd6518035b.txt","type":"text/plain","size":230}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"feature","value":"Tuple"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"c6f52d0b9e8ac3c5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cde5d1b46b10d7ac.json b/allure-report/data/test-cases/c74e320818fb9682.json similarity index 68% rename from allure-report/data/test-cases/cde5d1b46b10d7ac.json rename to allure-report/data/test-cases/c74e320818fb9682.json index 44a95e1dba3..b39ba2d554b 100644 --- a/allure-report/data/test-cases/cde5d1b46b10d7ac.json +++ b/allure-report/data/test-cases/c74e320818fb9682.json @@ -1 +1 @@ -{"uid":"cde5d1b46b10d7ac","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4783529dae6eb3af","status":"passed","time":{"start":1724733474757,"stop":1724733474757,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"f5a3f0d4d035c3a4","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}}]},"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"cde5d1b46b10d7ac.json","parameterValues":[]} \ No newline at end of file +{"uid":"c74e320818fb9682","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"c74e320818fb9682.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c77f51e83226296c.json b/allure-report/data/test-cases/c77f51e83226296c.json new file mode 100644 index 00000000000..073c7f2abbe --- /dev/null +++ b/allure-report/data/test-cases/c77f51e83226296c.json @@ -0,0 +1 @@ +{"uid":"c77f51e83226296c","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"description":"\n Testing calc class\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc class\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":21,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1732428193894,"stop":1732428193894,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"OPERATORS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5961f436380e11d2","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}},{"uid":"57e5e5f4d9d91cf6","status":"passed","time":{"start":1724733472280,"stop":1724733472280,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"693c5b2693478689","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}},{"uid":"d6d06cbc227917e","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}}]},"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"c77f51e83226296c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/95011c2c3c205658.json b/allure-report/data/test-cases/c7a63127b0ec26d9.json similarity index 57% rename from allure-report/data/test-cases/95011c2c3c205658.json rename to allure-report/data/test-cases/c7a63127b0ec26d9.json index 5f4a197887d..1c2dcb22531 100644 --- a/allure-report/data/test-cases/95011c2c3c205658.json +++ b/allure-report/data/test-cases/c7a63127b0ec26d9.json @@ -1 +1 @@ -{"uid":"95011c2c3c205658","name":"Square numbers (positive)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_25","historyId":"e1a83b5e7221ab7611b800cba5c64efa","time":{"start":1724735129352,"stop":1724735129352,"duration":0},"description":"\n 25 is a square number\n :return:\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1732428196100,"stop":1732428196101,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1732428196102,"stop":1732428196102,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"3d4f8cb2de087cf","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}},{"uid":"d58adc2ec0d31961","status":"passed","time":{"start":1724733474569,"stop":1724733474569,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d3037fd25424c6f3","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}},{"uid":"1d2c6842ef40288f","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"c7e963fd1c95dafe.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/90a114379d845ff7.json b/allure-report/data/test-cases/c7eea171ede7ee13.json similarity index 68% rename from allure-report/data/test-cases/90a114379d845ff7.json rename to allure-report/data/test-cases/c7eea171ede7ee13.json index 00e1529dfa5..0d268cbf43f 100644 --- a/allure-report/data/test-cases/90a114379d845ff7.json +++ b/allure-report/data/test-cases/c7eea171ede7ee13.json @@ -1 +1 @@ -{"uid":"90a114379d845ff7","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6ce0e167f1507713","name":"stdout","source":"6ce0e167f1507713.txt","type":"text/plain","size":242}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"90a114379d845ff7.json","parameterValues":[]} \ No newline at end of file +{"uid":"c7eea171ede7ee13","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8b338c3953869594","name":"stdout","source":"8b338c3953869594.txt","type":"text/plain","size":242}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"c7eea171ede7ee13.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/41ca81ef54591f7f.json b/allure-report/data/test-cases/c8870275fadfceea.json similarity index 70% rename from allure-report/data/test-cases/41ca81ef54591f7f.json rename to allure-report/data/test-cases/c8870275fadfceea.json index 89f6940f240..6e87679bc77 100644 --- a/allure-report/data/test-cases/41ca81ef54591f7f.json +++ b/allure-report/data/test-cases/c8870275fadfceea.json @@ -1 +1 @@ -{"uid":"41ca81ef54591f7f","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3a9eebe7718e7480","name":"stdout","source":"3a9eebe7718e7480.txt","type":"text/plain","size":2621}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"41ca81ef54591f7f.json","parameterValues":[]} \ No newline at end of file +{"uid":"c8870275fadfceea","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"939b7ea8b8b69174","name":"stdout","source":"939b7ea8b8b69174.txt","type":"text/plain","size":2621}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"c8870275fadfceea.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f5f1282b0eb8a484.json b/allure-report/data/test-cases/c898f599f64280c3.json similarity index 70% rename from allure-report/data/test-cases/f5f1282b0eb8a484.json rename to allure-report/data/test-cases/c898f599f64280c3.json index 0ac111b5bcc..f6cd601b993 100644 --- a/allure-report/data/test-cases/f5f1282b0eb8a484.json +++ b/allure-report/data/test-cases/c898f599f64280c3.json @@ -1 +1 @@ -{"uid":"f5f1282b0eb8a484","name":"Should return 'Fail!'s","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_fail","historyId":"a12b9599b8bf7b92d2c2e1462a17342d","time":{"start":1724733474944,"stop":1724733474944,"duration":0},"description":"\n If there are no good ideas,\n as is often the case, return 'Fail!'.\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Extend the list list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"15329bd7c41462e0","name":"stdout","source":"15329bd7c41462e0.txt","type":"text/plain","size":375}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a6a0450be3f30fe6","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"4359475f5ec554bd","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"826a0963540c6e75.json","parameterValues":[]} \ No newline at end of file +{"uid":"c89e6a91bc0b9e52","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Extend the list list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c629f823771e2123","name":"stdout","source":"c629f823771e2123.txt","type":"text/plain","size":375}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"c89e6a91bc0b9e52.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b97e3a9bf54f17f3.json b/allure-report/data/test-cases/c8c44a676a12b5c6.json similarity index 60% rename from allure-report/data/test-cases/b97e3a9bf54f17f3.json rename to allure-report/data/test-cases/c8c44a676a12b5c6.json index 168e10f0995..ca8e957439d 100644 --- a/allure-report/data/test-cases/b97e3a9bf54f17f3.json +++ b/allure-report/data/test-cases/c8c44a676a12b5c6.json @@ -1 +1 @@ -{"uid":"b97e3a9bf54f17f3","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"db0dfa2ecde82e2a","name":"stdout","source":"db0dfa2ecde82e2a.txt","type":"text/plain","size":23}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"e99ff83f7419b047","status":"passed","time":{"start":1724733475007,"stop":1724733475007,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"73d92f8f0c07772d","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"b97e3a9bf54f17f3.json","parameterValues":[]} \ No newline at end of file +{"uid":"c8c44a676a12b5c6","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e13819432a0a8bbc","name":"stdout","source":"e13819432a0a8bbc.txt","type":"text/plain","size":23}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"c8c44a676a12b5c6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c919701b7942665.json b/allure-report/data/test-cases/c919701b7942665.json new file mode 100644 index 00000000000..686e5793ba6 --- /dev/null +++ b/allure-report/data/test-cases/c919701b7942665.json @@ -0,0 +1 @@ +{"uid":"c919701b7942665","name":"'multiply' function verification with one element list","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest_one_element_list","historyId":"95946a599255beb095c6c7c676174082","time":{"start":1724735129211,"stop":1724735129211,"duration":0},"description":"\n Returns [] if list has only one element\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"edbe93ce737c702f","name":"stdout","source":"edbe93ce737c702f.txt","type":"text/plain","size":304}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"db267da7b8a1b004","status":"passed","time":{"start":1724733474210,"stop":1724733474210,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"5ef0ca25b0e8e9c5","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"5a941d3b90762a67.json","parameterValues":[]} \ No newline at end of file +{"uid":"c94aec0d920b7f7d","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4e248e61461ec35c","name":"stdout","source":"4e248e61461ec35c.txt","type":"text/plain","size":304}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"c94aec0d920b7f7d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a381266642fdbdd2.json b/allure-report/data/test-cases/cc1bd3cedb1bfef0.json similarity index 73% rename from allure-report/data/test-cases/a381266642fdbdd2.json rename to allure-report/data/test-cases/cc1bd3cedb1bfef0.json index f2eae654a24..9feba626e70 100644 --- a/allure-report/data/test-cases/a381266642fdbdd2.json +++ b/allure-report/data/test-cases/cc1bd3cedb1bfef0.json @@ -1 +1 @@ -{"uid":"a381266642fdbdd2","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9185450f0b6d0b62","name":"stdout","source":"9185450f0b6d0b62.txt","type":"text/plain","size":22}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"a381266642fdbdd2.json","parameterValues":[]} \ No newline at end of file +{"uid":"cc1bd3cedb1bfef0","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"10b8961e386c4fec","name":"stdout","source":"10b8961e386c4fec.txt","type":"text/plain","size":22}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"cc1bd3cedb1bfef0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cc5bed1d964110c.json b/allure-report/data/test-cases/cc5bed1d964110c.json deleted file mode 100644 index 68cc9663ea6..00000000000 --- a/allure-report/data/test-cases/cc5bed1d964110c.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"cc5bed1d964110c","name":"Testing 'DefaultList' class: __getitem__","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_basic","historyId":"7dba0545991d74ec4981bfb3eea48559","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a8f23a9981f406ff","name":"stdout","source":"a8f23a9981f406ff.txt","type":"text/plain","size":371}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"cc5bed1d964110c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cd862d92408a60a2.json b/allure-report/data/test-cases/cd862d92408a60a2.json deleted file mode 100644 index 3ae6a2521f8..00000000000 --- a/allure-report/data/test-cases/cd862d92408a60a2.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"cd862d92408a60a2","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string aba and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string moOse and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5705204dae406a16","name":"stdout","source":"5705204dae406a16.txt","type":"text/plain","size":401}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1dfdd5c5551a6420","status":"passed","time":{"start":1724733474304,"stop":1724733474304,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"3bd61bc704b417e2","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"cd862d92408a60a2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/884c8d1f852cc3dc.json b/allure-report/data/test-cases/cd9da9d797a3c2ab.json similarity index 53% rename from allure-report/data/test-cases/884c8d1f852cc3dc.json rename to allure-report/data/test-cases/cd9da9d797a3c2ab.json index e50aeb44bde..a08d6a00a55 100644 --- a/allure-report/data/test-cases/884c8d1f852cc3dc.json +++ b/allure-report/data/test-cases/cd9da9d797a3c2ab.json @@ -1 +1 @@ -{"uid":"884c8d1f852cc3dc","name":"Testing share_price function","fullName":"kyu_7.share_prices.test_share_price.SharePriceTestCase#test_share_price","historyId":"884fcf3671ca321076723a238ddb92c0","time":{"start":1724735129227,"stop":1724735129227,"duration":0},"description":"\n Testing share_price function\n with multiple test inputs\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have Dog arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 5 arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have good arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 50lb arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have brown arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6b3bb7e070cc7a5c","name":"stdout","source":"6b3bb7e070cc7a5c.txt","type":"text/plain","size":148}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":7,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e21dc9fd5c9ffdad","status":"passed","time":{"start":1724733474319,"stop":1724733474319,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"91ff78dc5a767b91","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}}]},"tags":[]},"source":"dead64fe3d4f484d.json","parameterValues":[]} \ No newline at end of file +{"uid":"d12fb82b623fefb9","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have Dog arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 5 arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have good arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 50lb arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have brown arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e04892408ba7673f","name":"stdout","source":"e04892408ba7673f.txt","type":"text/plain","size":148}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"d12fb82b623fefb9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d1974f16b30f7476.json b/allure-report/data/test-cases/d1974f16b30f7476.json new file mode 100644 index 00000000000..427c1d5ad01 --- /dev/null +++ b/allure-report/data/test-cases/d1974f16b30f7476.json @@ -0,0 +1 @@ +{"uid":"d1974f16b30f7476","name":"Non is expected","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_none","historyId":"262134764fa6664c0e3055da165452d3","time":{"start":1724733474647,"stop":1724733474663,"duration":16},"description":"\n If the whole array is consecutive then return\n null or Nothing or None.\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1732428194586,"stop":1732428194586,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solve' function with various test data\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1732428194588,"stop":1732428194588,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6030df3a53146090","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}},{"uid":"552742d77daecee9","status":"passed","time":{"start":1724733473093,"stop":1724733473093,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"41efd0d786aed73","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}},{"uid":"d1585e7c78fd8d06","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"d19efceb39f40f4f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d1a80d9f422182d.json b/allure-report/data/test-cases/d1a80d9f422182d.json deleted file mode 100644 index bd06f3e1a25..00000000000 --- a/allure-report/data/test-cases/d1a80d9f422182d.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"d1a80d9f422182d","name":"goals function verification","fullName":"kyu_8.grasshopper_messi_goals_function.test_messi_goals_function.GoalsTestCase#test_goals","historyId":"7c1c8c6318c554c86b695deacecf1854","time":{"start":1724735129492,"stop":1724735129492,"duration":0},"description":"\n Verify that the function returns Messi's\n total number of goals in all three leagues.\n :return:\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"763794db833f43e6","name":"stdout","source":"763794db833f43e6.txt","type":"text/plain","size":410}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9f6955234023cbe8","status":"passed","time":{"start":1724733474569,"stop":1724733474569,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"1d2c6842ef40288f","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"d3037fd25424c6f3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d38d4627913b0040.json b/allure-report/data/test-cases/d38d4627913b0040.json new file mode 100644 index 00000000000..3b87829cf49 --- /dev/null +++ b/allure-report/data/test-cases/d38d4627913b0040.json @@ -0,0 +1 @@ +{"uid":"d38d4627913b0040","name":"Testing to_alternating_case function","fullName":"kyu_8.alternating_case.test_alternating_case.AlternatingCaseTestCase#test_alternating_case","historyId":"470b5bb32c448e7433bb94b222d4d8b0","time":{"start":1724735129367,"stop":1724735129383,"duration":16},"description":"\n Testing to_alternating_case function\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5c0575d9cafe6cf6","name":"stdout","source":"5c0575d9cafe6cf6.txt","type":"text/plain","size":410}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":6,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Century From Year"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"9f6955234023cbe8.json","parameterValues":[]} \ No newline at end of file +{"uid":"d58adc2ec0d31961","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"22b576ff182f36ef","name":"stdout","source":"22b576ff182f36ef.txt","type":"text/plain","size":410}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Century From Year"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"d58adc2ec0d31961.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/19146436627ee869.json b/allure-report/data/test-cases/d58da60cf24b7660.json similarity index 73% rename from allure-report/data/test-cases/19146436627ee869.json rename to allure-report/data/test-cases/d58da60cf24b7660.json index 96b10678aa6..b2c01f8e17e 100644 --- a/allure-report/data/test-cases/19146436627ee869.json +++ b/allure-report/data/test-cases/d58da60cf24b7660.json @@ -1 +1 @@ -{"uid":"19146436627ee869","name":"Testing 'count_sheeps' function: empty list","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_empty_list","historyId":"64d02b3be7358667808060e04863e8f8","time":{"start":1724733474616,"stop":1724733474616,"duration":0},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like empty list\n :return:\n ","descriptionHtml":"Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6ccd74e070792411","name":"stdout","source":"6ccd74e070792411.txt","type":"text/plain","size":371}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"d7eae685c38fccbb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d820d165ec4b4b72.json b/allure-report/data/test-cases/d820d165ec4b4b72.json new file mode 100644 index 00000000000..d80b31ab503 --- /dev/null +++ b/allure-report/data/test-cases/d820d165ec4b4b72.json @@ -0,0 +1 @@ +{"uid":"d820d165ec4b4b72","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1732428195590,"stop":1732428195590,"duration":0},"description":"\n Testing potion function with various test inputs\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1732428195589,"stop":1732428195589,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing potion function with various test inputs\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1732428195590,"stop":1732428195590,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1732428195591,"stop":1732428195591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Potion Class 101"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Classes"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"47068bee5b06a234","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"95a29a9545c416cd","status":"passed","time":{"start":1724733474038,"stop":1724733474038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"cdfe495bc85470d2","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"7d1621a20d6f8fe7","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"d820d165ec4b4b72.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d9328098007f6ade.json b/allure-report/data/test-cases/d9328098007f6ade.json new file mode 100644 index 00000000000..de7d8fe15f7 --- /dev/null +++ b/allure-report/data/test-cases/d9328098007f6ade.json @@ -0,0 +1 @@ +{"uid":"d9328098007f6ade","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an un-existing item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a2cc2be21cb9d7cd","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"45f16c4708137d2d","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"99a050e28b9f808c","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"a33fb2570aec1823","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"d9328098007f6ade.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ca423ea5ac901436.json b/allure-report/data/test-cases/d936198953d58b58.json similarity index 76% rename from allure-report/data/test-cases/ca423ea5ac901436.json rename to allure-report/data/test-cases/d936198953d58b58.json index 68c69fdb029..37d38949974 100644 --- a/allure-report/data/test-cases/ca423ea5ac901436.json +++ b/allure-report/data/test-cases/d936198953d58b58.json @@ -1 +1 @@ -{"uid":"ca423ea5ac901436","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"ca423ea5ac901436.json","parameterValues":[]} \ No newline at end of file +{"uid":"d936198953d58b58","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"d936198953d58b58.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e2d8966b9a0500aa.json b/allure-report/data/test-cases/d97402e929388a59.json similarity index 66% rename from allure-report/data/test-cases/e2d8966b9a0500aa.json rename to allure-report/data/test-cases/d97402e929388a59.json index 85fc83cb6c5..75d12d26db1 100644 --- a/allure-report/data/test-cases/e2d8966b9a0500aa.json +++ b/allure-report/data/test-cases/d97402e929388a59.json @@ -1 +1 @@ -{"uid":"e2d8966b9a0500aa","name":"a or b is negative","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_negative_numbers","historyId":"2889ca714f21625b11b311b780ead719","time":{"start":1724733474179,"stop":1724733474179,"duration":0},"description":"\n a or b is negative\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472624,"stop":1724733472749,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"41f66f3f97e3d4e4","name":"stdout","source":"41f66f3f97e3d4e4.txt","type":"text/plain","size":46002}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"ce00ffd36d904f61.json","parameterValues":[]} \ No newline at end of file +{"uid":"dc1f8d6367d3e66e","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1724733472624,"stop":1724733472765,"duration":141},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472624,"stop":1724733472749,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8b32e9e6b9d5730c","name":"stdout","source":"8b32e9e6b9d5730c.txt","type":"text/plain","size":46002}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"dc1f8d6367d3e66e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ddd327d6f403c655.json b/allure-report/data/test-cases/dcee0c4d2268b964.json similarity index 74% rename from allure-report/data/test-cases/ddd327d6f403c655.json rename to allure-report/data/test-cases/dcee0c4d2268b964.json index 765eef5a91a..43f2bb89772 100644 --- a/allure-report/data/test-cases/ddd327d6f403c655.json +++ b/allure-report/data/test-cases/dcee0c4d2268b964.json @@ -1 +1 @@ -{"uid":"ddd327d6f403c655","name":"Testing zeros function","fullName":"kyu_5.number_of_trailing_zeros_of_n.test_zeros.ZerosTestCase#test_zeros","historyId":"bf37412e0e610d07d951e5fde674ec97","time":{"start":1724733472968,"stop":1724733472968,"duration":0},"description":"\n Testing 'zeros' program that should calculate the number\n of trailing zeros in a factorial of a given number.\n :return: None\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1732428196495,"stop":1732428196495,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1732428196496,"stop":1732428196496,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1732428196505,"stop":1732428196505,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"8beabd2469a668","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"6373ea673c2617a2","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"69f65011f131e2b6","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"5e4b0e05a0862f7e","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"dd76819b5fd836d3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d558fd9b3bcee4ae.json b/allure-report/data/test-cases/ddd928ac3a4fb635.json similarity index 60% rename from allure-report/data/test-cases/d558fd9b3bcee4ae.json rename to allure-report/data/test-cases/ddd928ac3a4fb635.json index 4b94dc0ee75..b88c1a5f05b 100644 --- a/allure-report/data/test-cases/d558fd9b3bcee4ae.json +++ b/allure-report/data/test-cases/ddd928ac3a4fb635.json @@ -1 +1 @@ -{"uid":"d558fd9b3bcee4ae","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"3ceac2ca244e095b","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"6ce4bba2ff4664c2","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"d558fd9b3bcee4ae.json","parameterValues":[]} \ No newline at end of file +{"uid":"ddd928ac3a4fb635","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"ddd928ac3a4fb635.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dde0d2c7fdfdde63.json b/allure-report/data/test-cases/dde0d2c7fdfdde63.json new file mode 100644 index 00000000000..6995367e0cf --- /dev/null +++ b/allure-report/data/test-cases/dde0d2c7fdfdde63.json @@ -0,0 +1 @@ +{"uid":"dde0d2c7fdfdde63","name":"Testing monkey_count function","fullName":"kyu_8.count_the_monkeys.test_monkey_count.MonkeyCountTestCase#test_monkey_count","historyId":"d34cb280748c185f029a17e9d0ab6437","time":{"start":1732428196126,"stop":1732428196126,"duration":0},"description":"\n Testing monkey_count function\n\n You take your son to the forest to see the monkeys.\n You know that there are a certain number there (n),\n but your son is too young to just appreciate the full\n number, he has to start counting them from 1.\n\n As a good parent, you will sit and count with him.\n Given the number (n), populate an array with all\n numbers up to and including that number, but excluding\n zero.\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc_combinations_per_row function\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c94aec0d920b7f7d","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}},{"uid":"32b8a7a180fb722f","status":"passed","time":{"start":1724733474210,"stop":1724733474210,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"5a941d3b90762a67","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}},{"uid":"5ef0ca25b0e8e9c5","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"de0aa71757f8badf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dcfefe9c10c1f5d2.json b/allure-report/data/test-cases/dea092a037f048cd.json similarity index 56% rename from allure-report/data/test-cases/dcfefe9c10c1f5d2.json rename to allure-report/data/test-cases/dea092a037f048cd.json index 92618deae91..2759f59d0ad 100644 --- a/allure-report/data/test-cases/dcfefe9c10c1f5d2.json +++ b/allure-report/data/test-cases/dea092a037f048cd.json @@ -1 +1 @@ -{"uid":"dcfefe9c10c1f5d2","name":"a or b is negative","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_negative_numbers","historyId":"2889ca714f21625b11b311b780ead719","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"description":"\n a or b is negative\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function that should take a shuffled list of\n unique numbers from 1 to n with one element missing\n (which can be any number including n). Should return\n this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1732428195546,"stop":1732428195546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"PERFORMANCE"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"82a681e3f0c8f54d","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}},{"uid":"c8870275fadfceea","status":"passed","time":{"start":1724733473991,"stop":1724733473991,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"3cf8d83dbb2d66b5","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}},{"uid":"f0e71551541527fc","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}}]},"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"e051944b31d54c14.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e08b527d12d4e4df.json b/allure-report/data/test-cases/e08b527d12d4e4df.json new file mode 100644 index 00000000000..72c6c242635 --- /dev/null +++ b/allure-report/data/test-cases/e08b527d12d4e4df.json @@ -0,0 +1 @@ +{"uid":"e08b527d12d4e4df","name":"Testing largestPower function","fullName":"kyu_7.powers_of_3.test_largest_power.LargestPowerTestCase#test_largest_power","historyId":"026739760bca73e921f8e5d35d9329cf","time":{"start":1732428195906,"stop":1732428195906,"duration":0},"description":"\n Testing largestPower function\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f1276b53d50f9117","name":"stdout","source":"f1276b53d50f9117.txt","type":"text/plain","size":428}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Factorial"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Color Choice"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4979ee3063a87441","status":"passed","time":{"start":1724733473124,"stop":1724733473124,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"3d3e842542b066f3","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"de04793abb90de01.json","parameterValues":[]} \ No newline at end of file +{"uid":"e186c7a758de768a","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"73d36ba66285cf8e","name":"stdout","source":"73d36ba66285cf8e.txt","type":"text/plain","size":428}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Factorial"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Color Choice"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"e186c7a758de768a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fa5b03edd274b2cd.json b/allure-report/data/test-cases/e1fe0122d9c0870d.json similarity index 53% rename from allure-report/data/test-cases/fa5b03edd274b2cd.json rename to allure-report/data/test-cases/e1fe0122d9c0870d.json index 381eba9604e..73e44216cea 100644 --- a/allure-report/data/test-cases/fa5b03edd274b2cd.json +++ b/allure-report/data/test-cases/e1fe0122d9c0870d.json @@ -1 +1 @@ -{"uid":"fa5b03edd274b2cd","name":"Testing the 'pyramid' function","fullName":"kyu_6.pyramid_array.test_pyramid_array.PyramidTestCase#test_pyramid","historyId":"73977fc23d0427de5570dbdeaca30321","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"description":"\n The 'pyramid' function should return\n an Array of ascending length subarrays.\n\n Note: the subarrays should be filled with 1s.\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d27167744db90954","name":"stdout","source":"d27167744db90954.txt","type":"text/plain","size":1013}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Performance"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Row of the odd triangle"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e9a0c341753d9526","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"4c3877c30e625752","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}}]},"tags":["PERFORMANCE","ALGORITHMS"]},"source":"9b82a842fdc9b867.json","parameterValues":[]} \ No newline at end of file +{"uid":"e378762a5dac9d1e","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a62856bc357d2685","name":"stdout","source":"a62856bc357d2685.txt","type":"text/plain","size":1013}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Performance"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Row of the odd triangle"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"e378762a5dac9d1e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cb5c8ea3b9796931.json b/allure-report/data/test-cases/e40b6e0fafdfb7a4.json similarity index 66% rename from allure-report/data/test-cases/cb5c8ea3b9796931.json rename to allure-report/data/test-cases/e40b6e0fafdfb7a4.json index e1ebdc73929..ed23663b25c 100644 --- a/allure-report/data/test-cases/cb5c8ea3b9796931.json +++ b/allure-report/data/test-cases/e40b6e0fafdfb7a4.json @@ -1 +1 @@ -{"uid":"cb5c8ea3b9796931","name":"Testing make_readable function","fullName":"kyu_5.human_readable_time.test_make_readable.MakeReadableTestCase#test_make_readable","historyId":"ca529ab6c57db539179bf256595c3d50","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"description":"\n Testing make_readable function\n\n Write a function, which takes a non-negative integer\n (seconds) as input and returns the time in a human-readable\n format (HH:MM:SS)\n\n HH = hours, padded to 2 digits, range: 00 - 99\n MM = minutes, padded to 2 digits, range: 00 - 59\n SS = seconds, padded to 2 digits, range: 00 - 59\n\n The maximum time never exceeds 359999 (99:59:59)\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f200722e18d9d59a","name":"stdout","source":"f200722e18d9d59a.txt","type":"text/plain","size":23}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":1,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"e99ff83f7419b047.json","parameterValues":[]} \ No newline at end of file +{"uid":"e427c3eece0f34c3","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"77c66732e5fdad66","name":"stdout","source":"77c66732e5fdad66.txt","type":"text/plain","size":23}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"e427c3eece0f34c3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/96bc84b88ae05ea5.json b/allure-report/data/test-cases/e47ebce66bbb53cd.json similarity index 92% rename from allure-report/data/test-cases/96bc84b88ae05ea5.json rename to allure-report/data/test-cases/e47ebce66bbb53cd.json index 13c47eab118..716585226bc 100644 --- a/allure-report/data/test-cases/96bc84b88ae05ea5.json +++ b/allure-report/data/test-cases/e47ebce66bbb53cd.json @@ -1 +1 @@ -{"uid":"96bc84b88ae05ea5","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1724733472577,"stop":1724733472577,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 24, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"96bc84b88ae05ea5.json","parameterValues":[]} \ No newline at end of file +{"uid":"e47ebce66bbb53cd","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1724733472577,"stop":1724733472577,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 24, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"e47ebce66bbb53cd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f534ec218cc4d08d.json b/allure-report/data/test-cases/e4f24bca4471f754.json similarity index 73% rename from allure-report/data/test-cases/f534ec218cc4d08d.json rename to allure-report/data/test-cases/e4f24bca4471f754.json index 897cef155ba..9df8ffd5415 100644 --- a/allure-report/data/test-cases/f534ec218cc4d08d.json +++ b/allure-report/data/test-cases/e4f24bca4471f754.json @@ -1 +1 @@ -{"uid":"f534ec218cc4d08d","name":"Testing 'has_subpattern' (part 2) function","fullName":"kyu_6.string_subpattern_recognition_2.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"3086879b276d25b4dd0f45ada5d9f20b","time":{"start":1724733474085,"stop":1724733474085,"duration":0},"description":"\n Verify that 'has_subpattern' function to returns\n either true/True or false/False if a string can be\n seen as the repetition of a simpler/shorter subpattern or not.\n\n 1. if a subpattern has been used, it will be repeated\n at least twice, meaning the subpattern has to be\n shorter than the original string;\n\n 2. the strings you will be given might or might not\n be created repeating a given subpattern, then\n shuffling the result.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"PARSING"},{"name":"story","value":"Count IP Addresses"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"945a96aedc88e8fe","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"a3216b951d3fac8b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"1dee8c06fd165199","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"e5ac2209dd79eabb","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"e5b1f301926fe23.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/e69093187fd70d56.json b/allure-report/data/test-cases/e69093187fd70d56.json
new file mode 100644
index 00000000000..4c1738a91d9
--- /dev/null
+++ b/allure-report/data/test-cases/e69093187fd70d56.json
@@ -0,0 +1 @@
+{"uid":"e69093187fd70d56","name":"Negative numbers","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_numbers","historyId":"baeb278025592b3aed00b5f1bc1265b1","time":{"start":1732428196075,"stop":1732428196075,"duration":0},"description":"\n -1: Negative numbers cannot be square numbers\n :return:\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e6af0cabbf264491","name":"stdout","source":"e6af0cabbf264491.txt","type":"text/plain","size":263}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":4,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"b5f6e3f148925a4f.json","parameterValues":[]} \ No newline at end of file +{"uid":"eaaef6c05ba4cb98","name":"Testing domain_name function","fullName":"kyu_5.extract_the_domain_name_from_url.test_domain_name.DomainNameTestCase#test_domain_name","historyId":"cd64b52319d4c70d68e281e8561ab97f","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c02985fbd2700004","name":"stdout","source":"c02985fbd2700004.txt","type":"text/plain","size":263}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"eaaef6c05ba4cb98.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ae7d3fce45bf33fb.json b/allure-report/data/test-cases/ebad30d100ba0d2f.json similarity index 59% rename from allure-report/data/test-cases/ae7d3fce45bf33fb.json rename to allure-report/data/test-cases/ebad30d100ba0d2f.json index 8c287a51573..8f5487b0d62 100644 --- a/allure-report/data/test-cases/ae7d3fce45bf33fb.json +++ b/allure-report/data/test-cases/ebad30d100ba0d2f.json @@ -1 +1 @@ -{"uid":"ae7d3fce45bf33fb","name":"Testing make_upper_case function","fullName":"kyu_8.make_upper_case.test_make_upper_case.MakeUpperCaseTestCase#test_make_upper_case","historyId":"9fe496d12a67f53b3208a0b823f2d8c3","time":{"start":1724735129602,"stop":1724735129602,"duration":0},"description":"\n Sample Tests for make_upper_case function\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8e2411421a238415","name":"stdout","source":"8e2411421a238415.txt","type":"text/plain","size":639}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":9,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Aggregations"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"1728ec761d912068.json","parameterValues":[]} \ No newline at end of file +{"uid":"ed566371d87065db","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c520dd2a3bb6ed30","name":"stdout","source":"c520dd2a3bb6ed30.txt","type":"text/plain","size":639}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Aggregations"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"ed566371d87065db.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ec6e703f7fb1f8f7.json b/allure-report/data/test-cases/edb4f03386c56c72.json similarity index 78% rename from allure-report/data/test-cases/ec6e703f7fb1f8f7.json rename to allure-report/data/test-cases/edb4f03386c56c72.json index 81fb93b8d4b..fd5b641750c 100644 --- a/allure-report/data/test-cases/ec6e703f7fb1f8f7.json +++ b/allure-report/data/test-cases/edb4f03386c56c72.json @@ -1 +1 @@ -{"uid":"ec6e703f7fb1f8f7","name":"Testing monkey_count function","fullName":"kyu_8.count_the_monkeys.test_monkey_count.MonkeyCountTestCase#test_monkey_count","historyId":"d34cb280748c185f029a17e9d0ab6437","time":{"start":1724733474585,"stop":1724733474600,"duration":15},"description":"\n Testing monkey_count function\n\n You take your son to the forest to see the monkeys.\n You know that there are a certain number there (n),\n but your son is too young to just appreciate the full\n number, he has to start counting them from 1.\n\n As a good parent, you will sit and count with him.\n Given the number (n), populate an array with all\n numbers up to and including that number, but excluding\n zero.\n :return:\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"21cec5980af4ec14","name":"stdout","source":"21cec5980af4ec14.txt","type":"text/plain","size":1009}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Snail"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"ede6b0c38e1de853.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ee3eb820ef7c27.json b/allure-report/data/test-cases/ee3eb820ef7c27.json new file mode 100644 index 00000000000..82dac762440 --- /dev/null +++ b/allure-report/data/test-cases/ee3eb820ef7c27.json @@ -0,0 +1 @@ +{"uid":"ee3eb820ef7c27","name":"Negative non consecutive number should be returned","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_negative","historyId":"f9c1f10fe995fd827dbc67efd6c689cb","time":{"start":1724733474647,"stop":1724733474647,"duration":0},"description":"\n non-consecutive is a negative number.\n :return:\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f4ad45627654b5fc","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"f4c5ff18f0370583","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"cf3552eb00513a1a.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"ef1a5cba4efb343a","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ef1a5cba4efb343a.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a08dd22616aac704.json b/allure-report/data/test-cases/ef2d26c76c436892.json
similarity index 94%
rename from allure-report/data/test-cases/a08dd22616aac704.json
rename to allure-report/data/test-cases/ef2d26c76c436892.json
index 19b3d468c21..d9ec4c20211 100644
--- a/allure-report/data/test-cases/a08dd22616aac704.json
+++ b/allure-report/data/test-cases/ef2d26c76c436892.json
@@ -1 +1 @@
-{"uid":"a08dd22616aac704","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Permutations"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"PERMUTATIONS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a08dd22616aac704.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"ef2d26c76c436892","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Permutations"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"PERMUTATIONS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ef2d26c76c436892.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/ef905ece7eeedc77.json b/allure-report/data/test-cases/ef905ece7eeedc77.json
new file mode 100644
index 00000000000..34f36cf90bd
--- /dev/null
+++ b/allure-report/data/test-cases/ef905ece7eeedc77.json
@@ -0,0 +1 @@
+{"uid":"ef905ece7eeedc77","name":"Testing the 'pyramid' function","fullName":"kyu_6.pyramid_array.test_pyramid_array.PyramidTestCase#test_pyramid","historyId":"73977fc23d0427de5570dbdeaca30321","time":{"start":1732428195597,"stop":1732428195598,"duration":1},"description":"\n The 'pyramid' function should return\n an Array of ascending length subarrays.\n\n Note: the subarrays should be filled with 1s.\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f1386283fe3a63a2","name":"stdout","source":"f1386283fe3a63a2.txt","type":"text/plain","size":1380}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":5,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"suite","value":"Character Encodings"},{"name":"feature","value":"String"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"BINARY"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"9cc84b4c3c851a20.json","parameterValues":[]} \ No newline at end of file +{"uid":"f00b7b6604c5e7e4","name":"Testing binary_to_string function","fullName":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string.SequenceTestCase#test_binary_to_string","historyId":"5e3d4a7b89a7ecee6b57c2383b63527b","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"30a819977a6f7bba","name":"stdout","source":"30a819977a6f7bba.txt","type":"text/plain","size":1380}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"suite","value":"Character Encodings"},{"name":"feature","value":"String"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"BINARY"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"f00b7b6604c5e7e4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/afae2f3faef55f2b.json b/allure-report/data/test-cases/f040925d9e513197.json similarity index 66% rename from allure-report/data/test-cases/afae2f3faef55f2b.json rename to allure-report/data/test-cases/f040925d9e513197.json index 2e80ae8a14b..9ca15ccdab7 100644 --- a/allure-report/data/test-cases/afae2f3faef55f2b.json +++ b/allure-report/data/test-cases/f040925d9e513197.json @@ -1 +1 @@ -{"uid":"afae2f3faef55f2b","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"54973229fb9bb954","name":"stdout","source":"54973229fb9bb954.txt","type":"text/plain","size":117}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"133341d40af1e905","status":"passed","time":{"start":1724733474975,"stop":1724733474975,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"627a7fd2fe38a284","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"afae2f3faef55f2b.json","parameterValues":[]} \ No newline at end of file +{"uid":"f040925d9e513197","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"443a1d8f74495540","name":"stdout","source":"443a1d8f74495540.txt","type":"text/plain","size":117}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"f040925d9e513197.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c7c7f21adbc73706.json b/allure-report/data/test-cases/f0700b9c803f7cf9.json similarity index 53% rename from allure-report/data/test-cases/c7c7f21adbc73706.json rename to allure-report/data/test-cases/f0700b9c803f7cf9.json index 9df7f93c106..8ace67831c4 100644 --- a/allure-report/data/test-cases/c7c7f21adbc73706.json +++ b/allure-report/data/test-cases/f0700b9c803f7cf9.json @@ -1 +1 @@ -{"uid":"c7c7f21adbc73706","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"62a27b454b36563d","name":"stdout","source":"62a27b454b36563d.txt","type":"text/plain","size":3097}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":8,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"RANKING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FILTERING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"68c4a39d8a6017b","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"647dfe698e2a6fdb","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"c7c7f21adbc73706.json","parameterValues":[]} \ No newline at end of file +{"uid":"f0700b9c803f7cf9","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5343662cb85dce05","name":"stdout","source":"5343662cb85dce05.txt","type":"text/plain","size":3097}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"RANKING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FILTERING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"f0700b9c803f7cf9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a6bf4a932c1ec147.json b/allure-report/data/test-cases/f11813f80ada0713.json similarity index 60% rename from allure-report/data/test-cases/a6bf4a932c1ec147.json rename to allure-report/data/test-cases/f11813f80ada0713.json index afd4f2b1550..488b1750f95 100644 --- a/allure-report/data/test-cases/a6bf4a932c1ec147.json +++ b/allure-report/data/test-cases/f11813f80ada0713.json @@ -1 +1 @@ -{"uid":"a6bf4a932c1ec147","name":"test_solution_big","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_big","historyId":"128bd70e221c2c2b932b5e8d4fdb22c0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 52, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"311e6a6343f5272c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"6827fd264cb4d263","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a6bf4a932c1ec147.json","parameterValues":[]} \ No newline at end of file +{"uid":"f11813f80ada0713","name":"test_solution_big","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_big","historyId":"128bd70e221c2c2b932b5e8d4fdb22c0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 52, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"f11813f80ada0713.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1319e1ae94efdc02.json b/allure-report/data/test-cases/f12b5c3f29ddd74a.json similarity index 69% rename from allure-report/data/test-cases/1319e1ae94efdc02.json rename to allure-report/data/test-cases/f12b5c3f29ddd74a.json index 76915efc38e..2b7ee99d028 100644 --- a/allure-report/data/test-cases/1319e1ae94efdc02.json +++ b/allure-report/data/test-cases/f12b5c3f29ddd74a.json @@ -1 +1 @@ -{"uid":"1319e1ae94efdc02","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Permutations"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a08dd22616aac704","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":0,"unknown":0,"total":2},"items":[{"uid":"6fbcaa806475fb37","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"1319e1ae94efdc02.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"f12b5c3f29ddd74a","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Permutations"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"f12b5c3f29ddd74a.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/7c2750d825fae93b.json b/allure-report/data/test-cases/f1a24ca70fa28a4b.json
similarity index 61%
rename from allure-report/data/test-cases/7c2750d825fae93b.json
rename to allure-report/data/test-cases/f1a24ca70fa28a4b.json
index 4f132457cc7..1cd6066a1ec 100644
--- a/allure-report/data/test-cases/7c2750d825fae93b.json
+++ b/allure-report/data/test-cases/f1a24ca70fa28a4b.json
@@ -1 +1 @@
-{"uid":"7c2750d825fae93b","name":"Wolf in the middle of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_in_middle","historyId":"3de540be96edd1a6ef052fccdb3f5cad","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"description":"\n If the wolf is the closest animal to you,\n return \"Pls go away and stop eating my sheep\".\n :return:\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":2,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"3ceac2ca244e095b.json","parameterValues":[]} \ No newline at end of file +{"uid":"f1d39787f3312e8b","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"f1d39787f3312e8b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f3baf14f5477154.json b/allure-report/data/test-cases/f3baf14f5477154.json new file mode 100644 index 00000000000..de01ac5f849 --- /dev/null +++ b/allure-report/data/test-cases/f3baf14f5477154.json @@ -0,0 +1 @@ +{"uid":"f3baf14f5477154","name":"Testing zeros function","fullName":"kyu_5.number_of_trailing_zeros_of_n.test_zeros.ZerosTestCase#test_zeros","historyId":"bf37412e0e610d07d951e5fde674ec97","time":{"start":1724735127860,"stop":1724735127860,"duration":0},"description":"\n Testing 'zeros' program that should calculate the number\n of trailing zeros in a factorial of a given number.\n :return: None\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f753b26a6d68bf5b","name":"stdout","source":"f753b26a6d68bf5b.txt","type":"text/plain","size":601}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a96041a690fcc058","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"99f691b62c390084","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"f80099cf6c294d2b.json","parameterValues":[]} \ No newline at end of file +{"uid":"f63a88604b1d062f","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8dfc11179dd2dd46","name":"stdout","source":"8dfc11179dd2dd46.txt","type":"text/plain","size":601}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"f63a88604b1d062f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4458ac38c6c9a97c.json b/allure-report/data/test-cases/f649ed8d3c87f7f8.json similarity index 72% rename from allure-report/data/test-cases/4458ac38c6c9a97c.json rename to allure-report/data/test-cases/f649ed8d3c87f7f8.json index 8e93c966d10..996b6393fa3 100644 --- a/allure-report/data/test-cases/4458ac38c6c9a97c.json +++ b/allure-report/data/test-cases/f649ed8d3c87f7f8.json @@ -1 +1 @@ -{"uid":"4458ac38c6c9a97c","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_test","historyId":"eb0582ce0674121869dd4f6fce46e7f3","time":{"start":1724733474538,"stop":1724733474538,"duration":0},"description":"\n 3 is not a square number\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428194244,"stop":1732428194248,"duration":4},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"58e0261647deccd2","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}},{"uid":"dc1f8d6367d3e66e","status":"passed","time":{"start":1724733472624,"stop":1724733472765,"duration":141}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"9cb8749ab5d5d5c7","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}},{"uid":"2ed8dfd7ca5a3d13","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}}]},"tags":["ALGORITHMS"]},"source":"f727d28e098b30b7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9d8518015a2b07b6.json b/allure-report/data/test-cases/f7656bca6b03073b.json similarity index 78% rename from allure-report/data/test-cases/9d8518015a2b07b6.json rename to allure-report/data/test-cases/f7656bca6b03073b.json index 0613a536463..4fd4d24167d 100644 --- a/allure-report/data/test-cases/9d8518015a2b07b6.json +++ b/allure-report/data/test-cases/f7656bca6b03073b.json @@ -1 +1 @@ -{"uid":"9d8518015a2b07b6","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6570d6c473e55397","name":"stdout","source":"6570d6c473e55397.txt","type":"text/plain","size":949}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":3,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"9d8518015a2b07b6.json","parameterValues":[]} \ No newline at end of file +{"uid":"f7656bca6b03073b","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2d58a8a8ac8fa12e","name":"stdout","source":"2d58a8a8ac8fa12e.txt","type":"text/plain","size":949}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"f7656bca6b03073b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f7d2073500029121.json b/allure-report/data/test-cases/f7d2073500029121.json new file mode 100644 index 00000000000..8a9ab39c9e9 --- /dev/null +++ b/allure-report/data/test-cases/f7d2073500029121.json @@ -0,0 +1 @@ +{"uid":"f7d2073500029121","name":"a or b is negative","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_negative_numbers","historyId":"2889ca714f21625b11b311b780ead719","time":{"start":1732428195746,"stop":1732428195746,"duration":0},"description":"\n a or b is negative\n :return:\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1732428193977,"stop":1732428193977,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"story","value":"Most frequently used words in a text"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"RANKING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f0700b9c803f7cf9","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"be618dffc8aac711","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"c7c7f21adbc73706","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"647dfe698e2a6fdb","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"f85ab0d3a8429db7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f8800adc39df0e11.json b/allure-report/data/test-cases/f8800adc39df0e11.json deleted file mode 100644 index a71d94d1a86..00000000000 --- a/allure-report/data/test-cases/f8800adc39df0e11.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"f8800adc39df0e11","name":"Testing largestPower function","fullName":"kyu_7.powers_of_3.test_largest_power.LargestPowerTestCase#test_largest_power","historyId":"026739760bca73e921f8e5d35d9329cf","time":{"start":1724733474366,"stop":1724733474366,"duration":0},"description":"\n Testing largestPower function\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calculate_damage with various test data\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1732428195581,"stop":1732428195581,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Games"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2b5bdabfec79d6cf","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"85284c487c263073","status":"passed","time":{"start":1724733474023,"stop":1724733474023,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"90a24ba96aea3cfc","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"396df158495e2556","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"f91e38b8c375d31c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4df49eaeb4ea4daa.json b/allure-report/data/test-cases/f97aaf8957be0a89.json similarity index 66% rename from allure-report/data/test-cases/4df49eaeb4ea4daa.json rename to allure-report/data/test-cases/f97aaf8957be0a89.json index 47234275d4f..a068bc7fe67 100644 --- a/allure-report/data/test-cases/4df49eaeb4ea4daa.json +++ b/allure-report/data/test-cases/f97aaf8957be0a89.json @@ -1 +1 @@ -{"uid":"4df49eaeb4ea4daa","name":"get_size function tests","fullName":"kyu_8.surface_area_and_volume_of_box.test_get_size.GetSizeTestCase#test_get_size","historyId":"ecc1f7419b2f77621f5c909f1d0df9a9","time":{"start":1724733474897,"stop":1724733474913,"duration":16},"description":"\n Testing get_size function with various inputs\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5bb3529b62d1131a","name":"stdout","source":"5bb3529b62d1131a.txt","type":"text/plain","size":565}],"parameters":[],"attachmentStep":false,"hasContent":true,"stepsCount":10,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"attachmentStep":false,"hasContent":false,"stepsCount":0,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"922eccc2ca8ed714","status":"passed","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"913459f449cde9ee","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}}]},"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"b01fd4e8d095b60f.json","parameterValues":[]} \ No newline at end of file +{"uid":"f9c645ee48c4616c","name":"Testing next_smaller function","fullName":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller.NextSmallerTestCase#test_next_smaller","historyId":"9d8cb8adf1764c55348d349698b938ac","time":{"start":1724735127235,"stop":1724735127250,"duration":15},"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1e1a39cd8bddfb25","name":"stdout","source":"1e1a39cd8bddfb25.txt","type":"text/plain","size":565}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"f9c645ee48c4616c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f9df20ba5fd613f1.json b/allure-report/data/test-cases/f9df20ba5fd613f1.json new file mode 100644 index 00000000000..0c7368481c9 --- /dev/null +++ b/allure-report/data/test-cases/f9df20ba5fd613f1.json @@ -0,0 +1 @@ +{"uid":"f9df20ba5fd613f1","name":"Testing decipher_this function","fullName":"kyu_6.decipher_this.test_decipher_this.DecipherThisTestCase#test_decipher_this","historyId":"ae3e8fd54712dd8496499b7bc14e7226","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"description":"\n Testing decipher_this function\n :param self:\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1732428195706,"stop":1732428195706,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing likes function with various test data\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428195706,"stop":1732428195706,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1732428195708,"stop":1732428195708,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Who likes it?"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1bdb6e0764902ab4","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}},{"uid":"8a9b52813983814b","status":"passed","time":{"start":1724733474132,"stop":1724733474132,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d7357eaa8c15ec47","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}},{"uid":"57946e73be805e2a","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"fb237eeb673713e3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fbd37fe4a302b125.json b/allure-report/data/test-cases/fbd37fe4a302b125.json new file mode 100644 index 00000000000..9ceb4f32708 --- /dev/null +++ b/allure-report/data/test-cases/fbd37fe4a302b125.json @@ -0,0 +1 @@ +{"uid":"fbd37fe4a302b125","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1732428195732,"stop":1732428195733,"duration":1},"description":"\n Testing calculate function with various test data\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1732428195732,"stop":1732428195732,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calculate function with various test data\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1732428195734,"stop":1732428195734,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5a497340f38e6588","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}},{"uid":"684d4d6fbb32213a","status":"passed","time":{"start":1724733474163,"stop":1724733474163,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"490cf50ddd5cff83","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}},{"uid":"7f4f9e94ec6d4f1e","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"fbd37fe4a302b125.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/14d00f76e0b4f9e4.json b/allure-report/data/test-cases/fbd7acf611333772.json similarity index 57% rename from allure-report/data/test-cases/14d00f76e0b4f9e4.json rename to allure-report/data/test-cases/fbd7acf611333772.json index 0c46f03d915..5a03da16096 100644 --- a/allure-report/data/test-cases/14d00f76e0b4f9e4.json +++ b/allure-report/data/test-cases/fbd7acf611333772.json @@ -1 +1 @@ -{"uid":"14d00f76e0b4f9e4","name":"Square numbers (positive)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_four","historyId":"861b34050c3ab0a994fa20a6090c5ab5","time":{"start":1724735129352,"stop":1724735129352,"duration":0},"description":"\n 4 is a square number\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1732428195635,"stop":1732428195635,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sort the odd"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5fd184f18d9496f9","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}},{"uid":"b921129ad79b857f","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"31cd5c9e8017f83c","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}},{"uid":"1ef3e1da7f90eb82","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}}]},"tags":["FUNDAMENTALS","ARRAYS"]},"source":"fc455123cb448d3e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fda81d5edcbfeda5.json b/allure-report/data/test-cases/fda81d5edcbfeda5.json new file mode 100644 index 00000000000..790ecced21f --- /dev/null +++ b/allure-report/data/test-cases/fda81d5edcbfeda5.json @@ -0,0 +1 @@ +{"uid":"fda81d5edcbfeda5","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1732428196158,"stop":1732428196158,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1f14a6ccebe34b08","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}},{"uid":"920950efadf9f044","status":"passed","time":{"start":1724733474632,"stop":1724733474632,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"9f7fc4731241a976","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}},{"uid":"cd298347a8b67e93","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"fda81d5edcbfeda5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fdff4b964fae0427.json b/allure-report/data/test-cases/fdff4b964fae0427.json deleted file mode 100644 index 3c7dd41679a..00000000000 --- a/allure-report/data/test-cases/fdff4b964fae0427.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"fdff4b964fae0427","name":"a and b are equal","fullName":"kyu_7.disemvowel_trolls.test_disemvowel_trolls.DisemvowelTestCase#test_disemvowel","historyId":"4171a558a2bea15b5a0546d36c9a1c63","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"description":"\n The string \"This website is for losers LOL!\"\n should become \"Ths wbst s fr lsrs LL!\"\n :return:\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2dd75c6915b1e704","name":"stdout","source":"2dd75c6915b1e704.txt","type":"text/plain","size":931}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sum of Pairs"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"MEMOIZATION"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"feature","value":"Memoization"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"997065a61e801d4c.json","parameterValues":[]} \ No newline at end of file +{"uid":"1065b8b44c0afc6f","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3f196c8197b3dace","name":"stdout","source":"3f196c8197b3dace.txt","type":"text/plain","size":931}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sum of Pairs"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"MEMOIZATION"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"feature","value":"Memoization"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"1065b8b44c0afc6f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/10f08e5166368fc8.json b/allure-report/data/test-cases/10f08e5166368fc8.json new file mode 100644 index 00000000000..0917ba481bd --- /dev/null +++ b/allure-report/data/test-cases/10f08e5166368fc8.json @@ -0,0 +1 @@ +{"uid":"10f08e5166368fc8","name":"Testing Warrior class >>> bruce_lee","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_bruce_lee","historyId":"7af7e9479cf2a47a636ae35231bacc9f","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1732428194139,"stop":1732428194139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert training","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert battle","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":12,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1732428194147,"stop":1732428194147,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"10f08e5166368fc8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/500ac2fecd2b527c.json b/allure-report/data/test-cases/11195fbf11e8bfc3.json similarity index 60% rename from allure-report/data/test-cases/500ac2fecd2b527c.json rename to allure-report/data/test-cases/11195fbf11e8bfc3.json index e39400a64c3..8062a46f94d 100644 --- a/allure-report/data/test-cases/500ac2fecd2b527c.json +++ b/allure-report/data/test-cases/11195fbf11e8bfc3.json @@ -1 +1 @@ -{"uid":"500ac2fecd2b527c","name":"Testing permute_a_palindrome (negative)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_negative","historyId":"7090b58c62fab362ad673c85c67765af","time":{"start":1724735128868,"stop":1724735128868,"duration":0},"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"suite","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Potion Class 101"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"95a29a9545c416cd.json","parameterValues":[]} \ No newline at end of file +{"uid":"111dbc365b1f3e78","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724733474038,"stop":1724733474038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"suite","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Potion Class 101"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"111dbc365b1f3e78.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/112ca50049d27c.json b/allure-report/data/test-cases/112ca50049d27c.json new file mode 100644 index 00000000000..539394fd953 --- /dev/null +++ b/allure-report/data/test-cases/112ca50049d27c.json @@ -0,0 +1 @@ +{"uid":"112ca50049d27c","name":"Should return 'Fail!'s","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_fail","historyId":"a12b9599b8bf7b92d2c2e1462a17342d","time":{"start":1732764221286,"stop":1732764221288,"duration":2},"description":"\n If there are no good ideas,\n as is often the case, return 'Fail!'.\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1732428196489,"stop":1732428196489,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1732428196491,"stop":1732428196491,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"113e69c4ee0f071.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b982073aac2c9d08.json b/allure-report/data/test-cases/117e19024dff1cfd.json similarity index 61% rename from allure-report/data/test-cases/b982073aac2c9d08.json rename to allure-report/data/test-cases/117e19024dff1cfd.json index 770c5535b1f..8435268529a 100644 --- a/allure-report/data/test-cases/b982073aac2c9d08.json +++ b/allure-report/data/test-cases/117e19024dff1cfd.json @@ -1 +1 @@ -{"uid":"b982073aac2c9d08","name":"Testing increment_string function","fullName":"kyu_5.string_incrementer.test_increment_string.StringIncrementerTestCase#test_increment_string","historyId":"5d0f5e220c2579103119e57300b46215","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"description":"\n Testing a function named increment_string\n\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'thirt' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1732428194553,"stop":1732428194553,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"772c9d6fdd465a8a","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"7a3ebc7dbd092b26","status":"passed","time":{"start":1724733473046,"stop":1724733473061,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"585949d19b46a5d2","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"66f1b8d1e5ed1dbe","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"777edc280c74020d.json","parameterValues":[]} \ No newline at end of file +{"uid":"1216cba41972f97c","name":"Testing 'thirt' function","fullName":"kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase#test_thirt","historyId":"b223f14337b9b49b6e64d94d9479e857","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"description":"\n Testing 'thirt' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'thirt' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1732428194550,"stop":1732428194550,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1732428194553,"stop":1732428194553,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"1216cba41972f97c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2db5e1fafcf7f4e1.json b/allure-report/data/test-cases/122ba025ebcea5dd.json similarity index 71% rename from allure-report/data/test-cases/2db5e1fafcf7f4e1.json rename to allure-report/data/test-cases/122ba025ebcea5dd.json index c7ad708daed..52ffe61d363 100644 --- a/allure-report/data/test-cases/2db5e1fafcf7f4e1.json +++ b/allure-report/data/test-cases/122ba025ebcea5dd.json @@ -1 +1 @@ -{"uid":"2db5e1fafcf7f4e1","name":"Testing 'sum_triangular_numbers' with positive numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_positive_numbers","historyId":"135e62f837ca5fe30ddfd2ad875e089b","time":{"start":1724733474491,"stop":1724733474491,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with positive numbers\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1732428195501,"stop":1732428195501,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1732428195504,"stop":1732428195504,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4544ac5de6415953","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}},{"uid":"951576068e42ee36","status":"passed","time":{"start":1724733473944,"stop":1724733473944,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d9458c8615b9e985","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}},{"uid":"863d982a547ab48a","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"87dc5713a007f1d7.json","parameterValues":[]} \ No newline at end of file +{"uid":"1230413e064883bb","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1732428195501,"stop":1732428195501,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1732428195501,"stop":1732428195501,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1732428195504,"stop":1732428195504,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"1230413e064883bb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1251fa1056fea3d4.json b/allure-report/data/test-cases/1251fa1056fea3d4.json new file mode 100644 index 00000000000..5b32476148a --- /dev/null +++ b/allure-report/data/test-cases/1251fa1056fea3d4.json @@ -0,0 +1 @@ +{"uid":"1251fa1056fea3d4","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1732764218832,"stop":1732764218832,"duration":0},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1732764218832,"stop":1732764218832,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1732764218832,"stop":1732764218832,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1732764218832,"stop":1732764218832,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1732764218832,"stop":1732764218832,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1732764218834,"stop":1732764218834,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"CONTROL FLOW"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"LOOPS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"dc89f010c8fc632","status":"passed","time":{"start":1732428194179,"stop":1732428194180,"duration":1}},{"uid":"86173a2048ae1d24","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"b9086c98d6d71504","status":"passed","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"1265911f14bcd919","status":"passed","time":{"start":1732428194179,"stop":1732428194180,"duration":1}},{"uid":"98d0f495e6dcba7e","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"df3147d31fee6968","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"1251fa1056fea3d4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1265911f14bcd919.json b/allure-report/data/test-cases/1265911f14bcd919.json deleted file mode 100644 index 77fa8634fea..00000000000 --- a/allure-report/data/test-cases/1265911f14bcd919.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"1265911f14bcd919","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1732428194179,"stop":1732428194180,"duration":1},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1732428194179,"stop":1732428194179,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"LOOPS"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"33fff97900a7d8bc","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"54043a9fba80789b","status":"passed","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"98d0f495e6dcba7e","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"df3147d31fee6968","status":"passed","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"1265911f14bcd919.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/12688af3a6e6b4d.json b/allure-report/data/test-cases/12688af3a6e6b4d.json deleted file mode 100644 index 95027662db0..00000000000 --- a/allure-report/data/test-cases/12688af3a6e6b4d.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"12688af3a6e6b4d","name":"Testing largestPower function","fullName":"kyu_7.powers_of_3.test_largest_power.LargestPowerTestCase#test_largest_power","historyId":"026739760bca73e921f8e5d35d9329cf","time":{"start":1724733474366,"stop":1724733474366,"duration":0},"description":"\n Testing largestPower function\n :return:\n ","descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1732428195853,"stop":1732428195853,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"62e01ffb20b661b5.json","parameterValues":[]} \ No newline at end of file +{"uid":"126c2e67245419a9","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_count_letters_and_digits","historyId":"0e1169325045c4d7d4ed6982c76387ed","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1732428195853,"stop":1732428195853,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1732428195854,"stop":1732428195854,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"126c2e67245419a9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e0b6b39a4d4f9bf4.json b/allure-report/data/test-cases/12c07b407ce072f5.json similarity index 67% rename from allure-report/data/test-cases/e0b6b39a4d4f9bf4.json rename to allure-report/data/test-cases/12c07b407ce072f5.json index c32362dd485..70ed72b666e 100644 --- a/allure-report/data/test-cases/e0b6b39a4d4f9bf4.json +++ b/allure-report/data/test-cases/12c07b407ce072f5.json @@ -1 +1 @@ -{"uid":"e0b6b39a4d4f9bf4","name":"Verify that greet function returns the proper message","fullName":"kyu_8.grasshopper_personalized_message.test_grasshopper_personalized_message.GreetTestCase#test_greet","historyId":"c07c7cb9e4aa2b6b273c9327f48ca674","time":{"start":1724733474710,"stop":1724733474710,"duration":0},"description":"\n Use conditionals to to verify that greet\n function returns the proper message.\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c02985fbd2700004","name":"stdout","source":"c02985fbd2700004.txt","type":"text/plain","size":263}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"eaaef6c05ba4cb98.json","parameterValues":[]} \ No newline at end of file +{"uid":"13c4343c88a790e8","name":"Testing domain_name function","fullName":"kyu_5.extract_the_domain_name_from_url.test_domain_name.DomainNameTestCase#test_domain_name","historyId":"cd64b52319d4c70d68e281e8561ab97f","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"287eb5fa3fe3b8e6","name":"stdout","source":"287eb5fa3fe3b8e6.txt","type":"text/plain","size":263}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"13c4343c88a790e8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/593778a5ba99d447.json b/allure-report/data/test-cases/13c5e35ef3c791a0.json similarity index 58% rename from allure-report/data/test-cases/593778a5ba99d447.json rename to allure-report/data/test-cases/13c5e35ef3c791a0.json index 8c664abe1b1..5a3e2eb6500 100644 --- a/allure-report/data/test-cases/593778a5ba99d447.json +++ b/allure-report/data/test-cases/13c5e35ef3c791a0.json @@ -1 +1 @@ -{"uid":"593778a5ba99d447","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1732428195787,"stop":1732428195788,"duration":1},"description":"\n Testing easy line function exception\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy line function exception\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1732428195787,"stop":1732428195788,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2dc119e05306bc09","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"d936198953d58b58","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"df0c490941a6877a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"c7106989a12e3c0a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"593778a5ba99d447.json","parameterValues":[]} \ No newline at end of file +{"uid":"13c5e35ef3c791a0","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1732428195787,"stop":1732428195788,"duration":1},"description":"\n Testing easy line function exception\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy line function exception\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1732428195787,"stop":1732428195788,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"13c5e35ef3c791a0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/13f340b5f893b4e2.json b/allure-report/data/test-cases/13f340b5f893b4e2.json new file mode 100644 index 00000000000..bf94ae32e60 --- /dev/null +++ b/allure-report/data/test-cases/13f340b5f893b4e2.json @@ -0,0 +1 @@ +{"uid":"13f340b5f893b4e2","name":"Square numbers (positive)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_four","historyId":"861b34050c3ab0a994fa20a6090c5ab5","time":{"start":1732764220797,"stop":1732764220798,"duration":1},"description":"\n 4 is a square number\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9252a83ce892d840","name":"stdout","source":"9252a83ce892d840.txt","type":"text/plain","size":1536}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"4f1172fa5620cc18.json","parameterValues":[]} \ No newline at end of file +{"uid":"14c8b0cd48caa4d6","name":"Testing the 'group_cities' function","fullName":"kyu_6.rotate_the_letters_of_each_element.test_group_cities.GroupCitiesTestCase#test_group_cities","historyId":"0b146f7fbac52b042804286da8716f6b","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fcd71aa1ac7b19de","name":"stdout","source":"fcd71aa1ac7b19de.txt","type":"text/plain","size":1536}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724735128899,"stop":1724735128899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"14c8b0cd48caa4d6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/14cdd8696beec9a.json b/allure-report/data/test-cases/14cdd8696beec9a.json new file mode 100644 index 00000000000..cd3c3734dd9 --- /dev/null +++ b/allure-report/data/test-cases/14cdd8696beec9a.json @@ -0,0 +1 @@ +{"uid":"14cdd8696beec9a","name":"Testing permute_a_palindrome (negative)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_negative","historyId":"7090b58c62fab362ad673c85c67765af","time":{"start":1732428195568,"stop":1732428195568,"duration":0},"description":"\n Negative testing permute_a_palindrome function\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_line function\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"38365b0f6f350ca5","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"64d00badde981bd3","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2aa3a63b6fff605a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"fb3ce43e36479ba0","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"28c03a6c5cc24cef.json","parameterValues":[]} \ No newline at end of file +{"uid":"156fc08ab7167514","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1732428195780,"stop":1732428195781,"duration":1},"description":"\n Testing easy_line function\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_line function\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1732428195781,"stop":1732428195781,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"156fc08ab7167514.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/15f47b991f284575.json b/allure-report/data/test-cases/15f47b991f284575.json deleted file mode 100644 index c7e20dc063a..00000000000 --- a/allure-report/data/test-cases/15f47b991f284575.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"15f47b991f284575","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":30,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1732428194156,"stop":1732428194156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b9ab4feb44c59984","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}},{"uid":"837e4ce24ac45efb","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"7f90afc62f8400f4","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}},{"uid":"a921030da8c9a520","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}}]},"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"15f47b991f284575.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/161e5fcc0f247.json b/allure-report/data/test-cases/161e5fcc0f247.json deleted file mode 100644 index 3fdf9b7217e..00000000000 --- a/allure-report/data/test-cases/161e5fcc0f247.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"161e5fcc0f247","name":"Testing 'solution' function","fullName":"kyu_7.pull_your_words_together_man.test_sentencify.SentencifyTestCase#test_sentencify","historyId":"5821e6355bce2a3bf46d4ce3e55de034","time":{"start":1724735129196,"stop":1724735129196,"duration":0},"description":"\n Testing 'sentencify' function.\n\n The function should:\n\n 1. Capitalise the first letter of the first word.\n 2. Add a period (.) to the end of the sentence.\n 3. Join the words into a complete string, with spaces.\n 4. Do no other manipulation on the words.\n\n :return:\n ","descriptionHtml":"Test a function that take as parameter a list ls and return a list of the sums of its parts as defined below:
ls = [1, 2, 3, 4, 5, 6]
parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]
Test a function that take as parameter a list ls and return a list of the sums of its parts as defined below:
ls = [1, 2, 3, 4, 5, 6]
parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]
The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5b8ca288b44682ec","name":"stdout","source":"5b8ca288b44682ec.txt","type":"text/plain","size":348}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Who likes it?"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"8a9b52813983814b.json","parameterValues":[]} \ No newline at end of file +{"uid":"168ffd09c766442f","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8e812b8e3303683b","name":"stdout","source":"8e812b8e3303683b.txt","type":"text/plain","size":348}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724733474132,"stop":1724733474132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Who likes it?"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"168ffd09c766442f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dd6fef8ab37d71ba.json b/allure-report/data/test-cases/170ac645fcf8229c.json similarity index 60% rename from allure-report/data/test-cases/dd6fef8ab37d71ba.json rename to allure-report/data/test-cases/170ac645fcf8229c.json index 19f22c3e6b1..bb98617c31f 100644 --- a/allure-report/data/test-cases/dd6fef8ab37d71ba.json +++ b/allure-report/data/test-cases/170ac645fcf8229c.json @@ -1 +1 @@ -{"uid":"dd6fef8ab37d71ba","name":"Testing 'sum_triangular_numbers' with big number as an input","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_big_number","historyId":"e2716f691be2a9d6b5fd30d66b1f784d","time":{"start":1732428196011,"stop":1732428196011,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with big number as an input\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence\n types, the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732764219332,"stop":1732764219332,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219332,"stop":1732764219332,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219332,"stop":1732764219332,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219333,"stop":1732764219333,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732764219359,"stop":1732764219359,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"story","value":"DefaultList"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a8e7ed0b9e8a05d4","status":"passed","time":{"start":1732428194656,"stop":1732428194656,"duration":0}},{"uid":"632eacb89b6e193e","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"4430fa612ad99844","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"8da01589d3299948","status":"passed","time":{"start":1732428194656,"stop":1732428194656,"duration":0}},{"uid":"ef7e94367cfcafa4","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"14e29fc6b385d9d8","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"17c9a97f8a5ea815.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/183ba5aa4a18280.json b/allure-report/data/test-cases/183ba5aa4a18280.json new file mode 100644 index 00000000000..45303676eab --- /dev/null +++ b/allure-report/data/test-cases/183ba5aa4a18280.json @@ -0,0 +1 @@ +{"uid":"183ba5aa4a18280","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_count_letters_and_digits","historyId":"0e1169325045c4d7d4ed6982c76387ed","time":{"start":1732764220545,"stop":1732764220545,"duration":0},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1732764220544,"stop":1732764220544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1732764220545,"stop":1732764220545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1732764220545,"stop":1732764220545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1732764220545,"stop":1732764220545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1732764220545,"stop":1732764220545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1732764220545,"stop":1732764220545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1732764220546,"stop":1732764220546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"7 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"126c2e67245419a9","status":"passed","time":{"start":1732428195854,"stop":1732428195854,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"62e01ffb20b661b5","status":"passed","time":{"start":1732428195854,"stop":1732428195854,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"183ba5aa4a18280.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1857a7ece8075aa5.json b/allure-report/data/test-cases/1857a7ece8075aa5.json new file mode 100644 index 00000000000..85630edf532 --- /dev/null +++ b/allure-report/data/test-cases/1857a7ece8075aa5.json @@ -0,0 +1 @@ +{"uid":"1857a7ece8075aa5","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1732764220424,"stop":1732764220424,"duration":0},"description":"\n Testing calculate function with various test data\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1732764220424,"stop":1732764220424,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calculate function with various test data\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1732764220424,"stop":1732764220424,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1732764220424,"stop":1732764220424,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1732764220424,"stop":1732764220424,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1732764220426,"stop":1732764220426,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"7 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1b6850c9f0a02820","status":"passed","time":{"start":1732428195732,"stop":1732428195733,"duration":1}},{"uid":"dc9bdff2273b81f8","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}},{"uid":"7ed5e03fb846420f","status":"passed","time":{"start":1724733474163,"stop":1724733474163,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"fbd37fe4a302b125","status":"passed","time":{"start":1732428195732,"stop":1732428195733,"duration":1}},{"uid":"490cf50ddd5cff83","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}},{"uid":"7f4f9e94ec6d4f1e","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"1857a7ece8075aa5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/190ed93e28b901b.json b/allure-report/data/test-cases/190ed93e28b901b.json new file mode 100644 index 00000000000..f8388ce96c0 --- /dev/null +++ b/allure-report/data/test-cases/190ed93e28b901b.json @@ -0,0 +1 @@ +{"uid":"190ed93e28b901b","name":"Verify that greet function returns the proper message","fullName":"kyu_8.grasshopper_personalized_message.test_grasshopper_personalized_message.GreetTestCase#test_greet","historyId":"c07c7cb9e4aa2b6b273c9327f48ca674","time":{"start":1732764220999,"stop":1732764220999,"duration":0},"description":"\n Use conditionals to to verify that greet\n function returns the proper message.\n :return:\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied\n by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732764218545,"stop":1732764218545,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1732764218548,"stop":1732764218548,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"VALIDATION"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"GAME BOARDS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"aec2fb642901e92","status":"passed","time":{"start":1732428193899,"stop":1732428193899,"duration":0}},{"uid":"1c217987ee1a1d39","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}},{"uid":"616388e3d3f3ad4c","status":"passed","time":{"start":1724733472296,"stop":1724733472296,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"bd11ee5929c6c53a","status":"passed","time":{"start":1732428193899,"stop":1732428193899,"duration":0}},{"uid":"5dad026541a05e65","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}},{"uid":"36b9e5073b489f49","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}}]},"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"1a13c6a89153460b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e78e70d10bce7cf5.json b/allure-report/data/test-cases/1a204aa873a93d86.json similarity index 56% rename from allure-report/data/test-cases/e78e70d10bce7cf5.json rename to allure-report/data/test-cases/1a204aa873a93d86.json index fc3968a7b46..3a089df8de2 100644 --- a/allure-report/data/test-cases/e78e70d10bce7cf5.json +++ b/allure-report/data/test-cases/1a204aa873a93d86.json @@ -1 +1 @@ -{"uid":"e78e70d10bce7cf5","name":"Testing Calculator class","fullName":"kyu_3.calculator.test_calculator.CalculatorTestCase#test_calculator","historyId":"939a8064e3d28ec85fadd67010b560ae","time":{"start":1732428193909,"stop":1732428193909,"duration":0},"description":"\n Testing Calculator class\n A simple calculator that given a string of operators '()', '+', '-', '*', '/'\n and numbers separated by spaces will return the value of that expression\n :return: None\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724735127938,"stop":1724735127938,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a68de0f4d0253c8","name":"stdout","source":"a68de0f4d0253c8.txt","type":"text/plain","size":318}],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"1a8f12ae9a258bd1.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1abde016dd7f5ee7.json b/allure-report/data/test-cases/1abde016dd7f5ee7.json new file mode 100644 index 00000000000..020d5cbc480 --- /dev/null +++ b/allure-report/data/test-cases/1abde016dd7f5ee7.json @@ -0,0 +1 @@ +{"uid":"1abde016dd7f5ee7","name":"Testing max_multiple function","fullName":"kyu_7.maximum_multiple.test_maximum_multiple.MaximumMultipleTestCase#test_maximum_multiple","historyId":"3181c0c2e1c9ba7b49a9f72369c7b0bb","time":{"start":1732764220590,"stop":1732764220590,"duration":0},"description":"\n Testing max_multiple function with\n various test data\n\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1732428195732,"stop":1732428195732,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calculate function with various test data\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1732428195734,"stop":1732428195734,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5a497340f38e6588","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}},{"uid":"684d4d6fbb32213a","status":"passed","time":{"start":1724733474163,"stop":1724733474163,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"490cf50ddd5cff83","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}},{"uid":"7f4f9e94ec6d4f1e","status":"passed","time":{"start":1724735129008,"stop":1724735129024,"duration":16}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"fbd37fe4a302b125.json","parameterValues":[]} \ No newline at end of file +{"uid":"1b6850c9f0a02820","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1732428195732,"stop":1732428195733,"duration":1},"description":"\n Testing calculate function with various test data\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1732428195732,"stop":1732428195732,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calculate function with various test data\n :return:\n ","descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1732428195733,"stop":1732428195733,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1732428195734,"stop":1732428195734,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"1b6850c9f0a02820.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/36b60db7bef82294.json b/allure-report/data/test-cases/1b6eab50f2f722f5.json similarity index 64% rename from allure-report/data/test-cases/36b60db7bef82294.json rename to allure-report/data/test-cases/1b6eab50f2f722f5.json index 9eafca65175..68e95235e1a 100644 --- a/allure-report/data/test-cases/36b60db7bef82294.json +++ b/allure-report/data/test-cases/1b6eab50f2f722f5.json @@ -1 +1 @@ -{"uid":"36b60db7bef82294","name":"Test that no_space function removes the spaces","fullName":"kyu_8.remove_string_spaces.test_remove_string_spaces.NoSpaceTestCase#test_something","historyId":"8069a1b5a4342457d2dabf5819382a2e","time":{"start":1724733474866,"stop":1724733474866,"duration":0},"description":"\n Test that no_space function removes the spaces\n from the string, then return the resultant string.\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function that should take a shuffled list of\n unique numbers from 1 to n with one element missing\n (which can be any number including n). Should return\n this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1732428195546,"stop":1732428195546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"PERFORMANCE"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"82a681e3f0c8f54d","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}},{"uid":"c8870275fadfceea","status":"passed","time":{"start":1724733473991,"stop":1724733473991,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"3cf8d83dbb2d66b5","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}},{"uid":"f0e71551541527fc","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}}]},"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"e051944b31d54c14.json","parameterValues":[]} \ No newline at end of file +{"uid":"1b7657273f039658","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"description":"\n Test a function that should take a shuffled list of\n unique numbers from 1 to n with one element missing\n (which can be any number including n). Should return\n this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function that should take a shuffled list of\n unique numbers from 1 to n with one element missing\n (which can be any number including n). Should return\n this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1732428195544,"stop":1732428195544,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1732428195546,"stop":1732428195546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"PERFORMANCE"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"1b7657273f039658.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4e32d03efab2941f.json b/allure-report/data/test-cases/1b95adcea61e4ef5.json similarity index 68% rename from allure-report/data/test-cases/4e32d03efab2941f.json rename to allure-report/data/test-cases/1b95adcea61e4ef5.json index 686ff87c6fa..154d20aeb6a 100644 --- a/allure-report/data/test-cases/4e32d03efab2941f.json +++ b/allure-report/data/test-cases/1b95adcea61e4ef5.json @@ -1 +1 @@ -{"uid":"4e32d03efab2941f","name":"'multiply' function verification: lists with multiple digits","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest","historyId":"6105a97f729c5e36b325cf44492db688","time":{"start":1724735129211,"stop":1724735129211,"duration":0},"description":"\n Test lists with multiple digits\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a62856bc357d2685","name":"stdout","source":"a62856bc357d2685.txt","type":"text/plain","size":1013}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Performance"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Row of the odd triangle"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"e378762a5dac9d1e.json","parameterValues":[]} \ No newline at end of file +{"uid":"1be5b98a41807de8","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d5812afb446c78ce","name":"stdout","source":"d5812afb446c78ce.txt","type":"text/plain","size":1013}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Performance"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Row of the odd triangle"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"1be5b98a41807de8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1bf4128bcf35143f.json b/allure-report/data/test-cases/1bf4128bcf35143f.json new file mode 100644 index 00000000000..6dffa75edb7 --- /dev/null +++ b/allure-report/data/test-cases/1bf4128bcf35143f.json @@ -0,0 +1 @@ +{"uid":"1bf4128bcf35143f","name":"Testing toJadenCase function (negative)","fullName":"kyu_7.jaden_casing_strings.test_jaden_casing_strings.JadenCasingStringsTestCase#test_to_jaden_case_negative","historyId":"3a2cad5dab684132d1f8974f9a6b5c75","time":{"start":1732764220563,"stop":1732764220563,"duration":0},"description":"\n Simple negative test\n :return:\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e160bbe65fc37bcd","name":"stdout","source":"e160bbe65fc37bcd.txt","type":"text/plain","size":3898}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"49355004a4136993.json","parameterValues":[]} \ No newline at end of file +{"uid":"1c217987ee1a1d39","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d1ef36a16a608c99","name":"stdout","source":"d1ef36a16a608c99.txt","type":"text/plain","size":3898}],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724735127157,"stop":1724735127157,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"1c217987ee1a1d39.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9abe86e868e9efe6.json b/allure-report/data/test-cases/1c33446eccccc45a.json similarity index 69% rename from allure-report/data/test-cases/9abe86e868e9efe6.json rename to allure-report/data/test-cases/1c33446eccccc45a.json index 99f9611de71..4c6150691ce 100644 --- a/allure-report/data/test-cases/9abe86e868e9efe6.json +++ b/allure-report/data/test-cases/1c33446eccccc45a.json @@ -1 +1 @@ -{"uid":"9abe86e868e9efe6","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3d8fef51a9e30706","name":"stdout","source":"3d8fef51a9e30706.txt","type":"text/plain","size":277}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAY"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"9abe86e868e9efe6.json","parameterValues":[]} \ No newline at end of file +{"uid":"1c33446eccccc45a","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"796b2b673c5d0f8b","name":"stdout","source":"796b2b673c5d0f8b.txt","type":"text/plain","size":277}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAY"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"1c33446eccccc45a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1c3655d4a978bd79.json b/allure-report/data/test-cases/1c3655d4a978bd79.json new file mode 100644 index 00000000000..d5d8b6f7662 --- /dev/null +++ b/allure-report/data/test-cases/1c3655d4a978bd79.json @@ -0,0 +1 @@ +{"uid":"1c3655d4a978bd79","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1732764220192,"stop":1732764220192,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1732764220190,"stop":1732764220190,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1732764220193,"stop":1732764220193,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1230413e064883bb","status":"passed","time":{"start":1732428195501,"stop":1732428195501,"duration":0}},{"uid":"ae5dc2ec4f03f9e5","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}},{"uid":"a7599be0f5459a3d","status":"passed","time":{"start":1724733473944,"stop":1724733473944,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"87dc5713a007f1d7","status":"passed","time":{"start":1732428195501,"stop":1732428195501,"duration":0}},{"uid":"d9458c8615b9e985","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}},{"uid":"863d982a547ab48a","status":"passed","time":{"start":1724735128805,"stop":1724735128805,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"1c3655d4a978bd79.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1c8c3b6600a20e75.json b/allure-report/data/test-cases/1c8c3b6600a20e75.json deleted file mode 100644 index eaf80b39ab3..00000000000 --- a/allure-report/data/test-cases/1c8c3b6600a20e75.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"1c8c3b6600a20e75","name":"Testing permute_a_palindrome (negative)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_negative","historyId":"7090b58c62fab362ad673c85c67765af","time":{"start":1732428195568,"stop":1732428195568,"duration":0},"description":"\n Negative testing permute_a_palindrome function\n :return:\n ","descriptionHtml":"Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing binary_to_string function\n with various test data\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1732428194580,"stop":1732428194580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"BINARY"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FORMATS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"suite","value":"Character Encodings"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8949506fce676285","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"f00b7b6604c5e7e4","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2b38fe6b8a5a46","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"5c281d5272513bfd","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"1d2104b5fa1d29b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ab40fd2a8eefa024.json b/allure-report/data/test-cases/1d437c172b71c55f.json similarity index 78% rename from allure-report/data/test-cases/ab40fd2a8eefa024.json rename to allure-report/data/test-cases/1d437c172b71c55f.json index 243803973ff..a8b793c760e 100644 --- a/allure-report/data/test-cases/ab40fd2a8eefa024.json +++ b/allure-report/data/test-cases/1d437c172b71c55f.json @@ -1 +1 @@ -{"uid":"ab40fd2a8eefa024","name":"Testing monkey_count function","fullName":"kyu_8.count_the_monkeys.test_monkey_count.MonkeyCountTestCase#test_monkey_count","historyId":"d34cb280748c185f029a17e9d0ab6437","time":{"start":1724735129414,"stop":1724735129414,"duration":0},"description":"\n Testing monkey_count function\n\n You take your son to the forest to see the monkeys.\n You know that there are a certain number there (n),\n but your son is too young to just appreciate the full\n number, he has to start counting them from 1.\n\n As a good parent, you will sit and count with him.\n Given the number (n), populate an array with all\n numbers up to and including that number, but excluding\n zero.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1732428193969,"stop":1732428193969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FORMATS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Human readable duration format"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"31050b40d7651adc","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"bc039aea1f276c5c","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"47f8df09a84d8337","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"409595d25cc5d60c","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"7cc0844ab5ecf216.json","parameterValues":[]} \ No newline at end of file +{"uid":"1e6c7d1c4189d9dd","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1732428193967,"stop":1732428193967,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":13,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1732428193969,"stop":1732428193969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FORMATS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Human readable duration format"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"1e6c7d1c4189d9dd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1f1df83d6cc10b66.json b/allure-report/data/test-cases/1f1df83d6cc10b66.json new file mode 100644 index 00000000000..0904a500cea --- /dev/null +++ b/allure-report/data/test-cases/1f1df83d6cc10b66.json @@ -0,0 +1 @@ +{"uid":"1f1df83d6cc10b66","name":"fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1732764221169,"stop":1732764221169,"duration":0},"description":"\n Testing fix_the_meerkat function with various test data\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1732764221169,"stop":1732764221169,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing fix_the_meerkat function with various test data\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1732764221169,"stop":1732764221169,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1732764221169,"stop":1732764221169,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1732764221169,"stop":1732764221169,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1732764221169,"stop":1732764221169,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1732764221169,"stop":1732764221169,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1732764221172,"stop":1732764221172,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"story","value":"My head is at the wrong end!"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"epic","value":"8 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f7d9041670997ad6","status":"passed","time":{"start":1732428196336,"stop":1732428196336,"duration":0}},{"uid":"5c657b72ebb12427","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}},{"uid":"a0013817978e9f1b","status":"passed","time":{"start":1724733474850,"stop":1724733474850,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"9c241cc9403723af","status":"passed","time":{"start":1732428196336,"stop":1732428196336,"duration":0}},{"uid":"deed80da6e08bd69","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}},{"uid":"1152e12f582a6d83","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}}]},"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"1f1df83d6cc10b66.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f85ab0d3a8429db7.json b/allure-report/data/test-cases/1f21450476aa4c9a.json similarity index 51% rename from allure-report/data/test-cases/f85ab0d3a8429db7.json rename to allure-report/data/test-cases/1f21450476aa4c9a.json index 8747d0a04d4..b69b240b0d7 100644 --- a/allure-report/data/test-cases/f85ab0d3a8429db7.json +++ b/allure-report/data/test-cases/1f21450476aa4c9a.json @@ -1 +1 @@ -{"uid":"f85ab0d3a8429db7","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1732428193975,"stop":1732428193976,"duration":1},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1732428193977,"stop":1732428193977,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"story","value":"Most frequently used words in a text"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"RANKING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f0700b9c803f7cf9","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"be618dffc8aac711","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"c7c7f21adbc73706","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"647dfe698e2a6fdb","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"f85ab0d3a8429db7.json","parameterValues":[]} \ No newline at end of file +{"uid":"1f21450476aa4c9a","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1732428193975,"stop":1732428193976,"duration":1},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732428193975,"stop":1732428193975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732428193976,"stop":1732428193976,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1732428193977,"stop":1732428193977,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"story","value":"Most frequently used words in a text"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"RANKING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"1f21450476aa4c9a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/200b5f0b4ec790a3.json b/allure-report/data/test-cases/200b5f0b4ec790a3.json new file mode 100644 index 00000000000..b9264f37e3a --- /dev/null +++ b/allure-report/data/test-cases/200b5f0b4ec790a3.json @@ -0,0 +1 @@ +{"uid":"200b5f0b4ec790a3","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1732764219366,"stop":1732764219372,"duration":6},"description":"\n Testing epidemic function\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1732764219366,"stop":1732764219366,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing epidemic function\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1732764219367,"stop":1732764219367,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1732764219367,"stop":1732764219367,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1732764219367,"stop":1732764219367,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1732764219369,"stop":1732764219369,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1732764219370,"stop":1732764219370,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1732764219370,"stop":1732764219370,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1732764219370,"stop":1732764219370,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1732764219371,"stop":1732764219371,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1732764219371,"stop":1732764219371,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1732764219372,"stop":1732764219372,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1732764219373,"stop":1732764219373,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Disease Spread"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c7c4d343c90ce082","status":"passed","time":{"start":1732428194686,"stop":1732428194689,"duration":3}},{"uid":"4c31a5ec99c6ca69","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}},{"uid":"437936b48694b75d","status":"passed","time":{"start":1724733473186,"stop":1724733473186,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"5f6f3bc16b3488d6","status":"passed","time":{"start":1732428194686,"stop":1732428194689,"duration":3}},{"uid":"c1e0648976f6a694","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}},{"uid":"b3f7088fed8dedd7","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"200b5f0b4ec790a3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/76dad62f743b3603.json b/allure-report/data/test-cases/200c9d07d930b3b1.json similarity index 72% rename from allure-report/data/test-cases/76dad62f743b3603.json rename to allure-report/data/test-cases/200c9d07d930b3b1.json index 66039d3377f..d86011c0bd3 100644 --- a/allure-report/data/test-cases/76dad62f743b3603.json +++ b/allure-report/data/test-cases/200c9d07d930b3b1.json @@ -1 +1 @@ -{"uid":"76dad62f743b3603","name":"Testing flatten function","fullName":"kyu_5.flatten.test_flatten.FlattenTestCase#test_flatten","historyId":"bf9ab588ec37b96b09a8d0c56f74fc4a","time":{"start":1724735127672,"stop":1724735127672,"duration":0},"description":"\n For this exercise you will create a global flatten method.\n The method takes in any number of arguments and flattens\n them into a single array. If any of the arguments passed in\n are an array then the individual objects within the array\n will be flattened so that they exist at the same level as\n the other arguments. Any nested arrays, no matter how deep,\n should be flattened into the single array result.\n\n The following are examples of how this function would be\n used and what the expected results would be:\n\n flatten(1, [2, 3], 4, 5, [6, [7]]) # returns [1, 2, 3, 4, 5, 6, 7]\n flatten('a', ['b', 2], 3, None, [[4], ['c']]) # returns ['a', 'b', 2, 3, None, 4, 'c']\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ca908a3276ec1f33","name":"stdout","source":"ca908a3276ec1f33.txt","type":"text/plain","size":434}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"99ca7a938f9d4989.json","parameterValues":[]} \ No newline at end of file +{"uid":"22f939e586318511","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"358b4a5251243888","name":"stdout","source":"358b4a5251243888.txt","type":"text/plain","size":434}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"22f939e586318511.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d19efceb39f40f4f.json b/allure-report/data/test-cases/23151e1dbdaacb09.json similarity index 54% rename from allure-report/data/test-cases/d19efceb39f40f4f.json rename to allure-report/data/test-cases/23151e1dbdaacb09.json index 68bf219f3c9..5ebed6e73e6 100644 --- a/allure-report/data/test-cases/d19efceb39f40f4f.json +++ b/allure-report/data/test-cases/23151e1dbdaacb09.json @@ -1 +1 @@ -{"uid":"d19efceb39f40f4f","name":"Testing solve function","fullName":"kyu_6.casino_chips.test_solve.SolveTestCase#test_solve","historyId":"47a8a15643c132c9b9f0d902bcff28dd","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"description":"\n Testing 'solve' function with various test data\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1732428194586,"stop":1732428194586,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solve' function with various test data\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1732428194588,"stop":1732428194588,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6030df3a53146090","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}},{"uid":"552742d77daecee9","status":"passed","time":{"start":1724733473093,"stop":1724733473093,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"41efd0d786aed73","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}},{"uid":"d1585e7c78fd8d06","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"d19efceb39f40f4f.json","parameterValues":[]} \ No newline at end of file +{"uid":"23151e1dbdaacb09","name":"Testing solve function","fullName":"kyu_6.casino_chips.test_solve.SolveTestCase#test_solve","historyId":"47a8a15643c132c9b9f0d902bcff28dd","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"description":"\n Testing 'solve' function with various test data\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1732428194586,"stop":1732428194586,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solve' function with various test data\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1732428194587,"stop":1732428194587,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":13,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1732428194588,"stop":1732428194588,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"23151e1dbdaacb09.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/59e6c1fe5b50c363.json b/allure-report/data/test-cases/23199ebc2c7c1fa2.json similarity index 67% rename from allure-report/data/test-cases/59e6c1fe5b50c363.json rename to allure-report/data/test-cases/23199ebc2c7c1fa2.json index 869ac3e8bd1..275adda6326 100644 --- a/allure-report/data/test-cases/59e6c1fe5b50c363.json +++ b/allure-report/data/test-cases/23199ebc2c7c1fa2.json @@ -1 +1 @@ -{"uid":"59e6c1fe5b50c363","name":"Testing 'sum_triangular_numbers' with negative numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_negative_numbers","historyId":"4e553d5e3ff5fc5c21a746a843af96e5","time":{"start":1724735129305,"stop":1724735129305,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with negative numbers\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Extend the list list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cd5591b59d574128","name":"stdout","source":"cd5591b59d574128.txt","type":"text/plain","size":375}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"23e61e29448b9218.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/108dd2ab8a90859d.json b/allure-report/data/test-cases/23e7f7a9e25073fa.json similarity index 75% rename from allure-report/data/test-cases/108dd2ab8a90859d.json rename to allure-report/data/test-cases/23e7f7a9e25073fa.json index 3b8b067f22b..16a283dd799 100644 --- a/allure-report/data/test-cases/108dd2ab8a90859d.json +++ b/allure-report/data/test-cases/23e7f7a9e25073fa.json @@ -1 +1 @@ -{"uid":"108dd2ab8a90859d","name":"Testing 'count_sheeps' function: bad input","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_bad_input","historyId":"4837bd231004cf7ec289887c52c12796","time":{"start":1724735129414,"stop":1724735129430,"duration":16},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like null/undefined\n :return:\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"38c339de2200090","name":"stdout","source":"38c339de2200090.txt","type":"text/plain","size":878}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"2483ff464fe4ea07.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ef1a5cba4efb343a.json b/allure-report/data/test-cases/2488d38c1be516d6.json similarity index 93% rename from allure-report/data/test-cases/ef1a5cba4efb343a.json rename to allure-report/data/test-cases/2488d38c1be516d6.json index 8e543b441a7..b83830ddd32 100644 --- a/allure-report/data/test-cases/ef1a5cba4efb343a.json +++ b/allure-report/data/test-cases/2488d38c1be516d6.json @@ -1 +1 @@ -{"uid":"ef1a5cba4efb343a","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ef1a5cba4efb343a.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"2488d38c1be516d6","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"2488d38c1be516d6.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/24b136640bd96c68.json b/allure-report/data/test-cases/24b136640bd96c68.json
new file mode 100644
index 00000000000..769b23970db
--- /dev/null
+++ b/allure-report/data/test-cases/24b136640bd96c68.json
@@ -0,0 +1 @@
+{"uid":"24b136640bd96c68","name":"Testing invite_more_women function (positive)","fullName":"kyu_7.simple_fun_152.test_invite_more_women.InviteMoreWomenTestCase#test_invite_more_women_positive","historyId":"d8680aad50eda2b69694580584e0455f","time":{"start":1724733474429,"stop":1724733474429,"duration":0},"description":"\n Simple Fun #152: Invite More Women?\n Testing invite_more_women function (positive)\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d8ed65aadf059368","name":"stdout","source":"d8ed65aadf059368.txt","type":"text/plain","size":318}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"7a3ebc7dbd092b26.json","parameterValues":[]} \ No newline at end of file +{"uid":"24b32ad032525022","name":"Testing 'thirt' function","fullName":"kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase#test_thirt","historyId":"b223f14337b9b49b6e64d94d9479e857","time":{"start":1724733473046,"stop":1724733473061,"duration":15},"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724733473046,"stop":1724733473046,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"22c24dd6f011f9a2","name":"stdout","source":"22c24dd6f011f9a2.txt","type":"text/plain","size":318}],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"24b32ad032525022.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1ca9562da84c64b4.json b/allure-report/data/test-cases/24df9329b634133a.json similarity index 72% rename from allure-report/data/test-cases/1ca9562da84c64b4.json rename to allure-report/data/test-cases/24df9329b634133a.json index c2cc6c8d6b7..bf290096f6f 100644 --- a/allure-report/data/test-cases/1ca9562da84c64b4.json +++ b/allure-report/data/test-cases/24df9329b634133a.json @@ -1 +1 @@ -{"uid":"1ca9562da84c64b4","name":"Testing to_alternating_case function","fullName":"kyu_8.alternating_case.test_alternating_case.AlternatingCaseTestCase#test_alternating_case","historyId":"470b5bb32c448e7433bb94b222d4d8b0","time":{"start":1724733474554,"stop":1724733474554,"duration":0},"description":"\n Testing to_alternating_case function\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Extend the list list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c629f823771e2123","name":"stdout","source":"c629f823771e2123.txt","type":"text/plain","size":375}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"c89e6a91bc0b9e52.json","parameterValues":[]} \ No newline at end of file +{"uid":"256439519ef758bc","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Extend the list list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"47a1750ca1ae0253","name":"stdout","source":"47a1750ca1ae0253.txt","type":"text/plain","size":375}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"256439519ef758bc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b6d0f7b70ff35380.json b/allure-report/data/test-cases/25a19c539143ffc2.json similarity index 58% rename from allure-report/data/test-cases/b6d0f7b70ff35380.json rename to allure-report/data/test-cases/25a19c539143ffc2.json index 2a1da48897b..36ee59054c8 100644 --- a/allure-report/data/test-cases/b6d0f7b70ff35380.json +++ b/allure-report/data/test-cases/25a19c539143ffc2.json @@ -1 +1 @@ -{"uid":"b6d0f7b70ff35380","name":"test_sequence","fullName":"kyu_6.no_arithmetic_progressions.test_sequence.SequenceTestCase#test_sequence","historyId":"4f7c4b258ce2dd212abc76d538a956bd","time":{"start":1732428195535,"stop":1732428195535,"duration":0},"description":"\n A function f(n), should returns the n-th member of sequence.\n :return:\n ","descriptionHtml":" A function f(n), should returns the n-th member of sequence.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_6\\\\no_arithmetic_progressions\\\\test_sequence.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"No arithmetic progressions"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.no_arithmetic_progressions.test_sequence"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0607115654a900140b3ce3","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c6eafeb1b2d72c83","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}},{"uid":"910c497042fbb9d7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733473976,"stop":1724733473976,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"b72d4e8ad3288d1b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}},{"uid":"900ed6bd99df3d56","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}}]},"tags":["ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"b6d0f7b70ff35380.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"25a19c539143ffc2","name":"test_sequence","fullName":"kyu_6.no_arithmetic_progressions.test_sequence.SequenceTestCase#test_sequence","historyId":"4f7c4b258ce2dd212abc76d538a956bd","time":{"start":1732428195535,"stop":1732428195535,"duration":0},"description":"\n A function f(n), should returns the n-th member of sequence.\n :return:\n ","descriptionHtml":" A function f(n), should returns the n-th member of sequence.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_6\\\\no_arithmetic_progressions\\\\test_sequence.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"No arithmetic progressions"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.no_arithmetic_progressions.test_sequence"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0607115654a900140b3ce3","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"25a19c539143ffc2.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/27b26e7a6523571a.json b/allure-report/data/test-cases/25b0f3d782a2ed03.json
similarity index 63%
rename from allure-report/data/test-cases/27b26e7a6523571a.json
rename to allure-report/data/test-cases/25b0f3d782a2ed03.json
index d3822f605e5..c93409aa6c4 100644
--- a/allure-report/data/test-cases/27b26e7a6523571a.json
+++ b/allure-report/data/test-cases/25b0f3d782a2ed03.json
@@ -1 +1 @@
-{"uid":"27b26e7a6523571a","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cb2ee8571e9e5841","name":"stdout","source":"cb2ee8571e9e5841.txt","type":"text/plain","size":530}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"27b26e7a6523571a.json","parameterValues":[]} \ No newline at end of file +{"uid":"25b0f3d782a2ed03","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fec9fd349f1d045f","name":"stdout","source":"fec9fd349f1d045f.txt","type":"text/plain","size":530}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"25b0f3d782a2ed03.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f701011259e850f6.json b/allure-report/data/test-cases/26a447cb7c15cb4e.json similarity index 54% rename from allure-report/data/test-cases/f701011259e850f6.json rename to allure-report/data/test-cases/26a447cb7c15cb4e.json index 05d99323eda..ca43067985d 100644 --- a/allure-report/data/test-cases/f701011259e850f6.json +++ b/allure-report/data/test-cases/26a447cb7c15cb4e.json @@ -1 +1 @@ -{"uid":"f701011259e850f6","name":"Test with regular string","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings","historyId":"12f0f975ccfd38a2860e83db6017e19f","time":{"start":1732428196359,"stop":1732428196359,"duration":0},"description":"\n Test with regular string\n :return:\n ","descriptionHtml":" A function f(n), should returns the n-th member of sequence.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_6\\\\no_arithmetic_progressions\\\\test_sequence.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"No arithmetic progressions"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.no_arithmetic_progressions.test_sequence"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0607115654a900140b3ce3","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"25a19c539143ffc2","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428195535,"stop":1732428195535,"duration":0}},{"uid":"bda7ad5e74660b56","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}},{"uid":"d6fd6e0593022837","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733473976,"stop":1724733473976,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"b6d0f7b70ff35380","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428195535,"stop":1732428195535,"duration":0}},{"uid":"b72d4e8ad3288d1b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}},{"uid":"900ed6bd99df3d56","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735128836,"stop":1724735128836,"duration":0}}]},"tags":["ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"2890c501d19b5f47.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/28a9bedc22c54787.json b/allure-report/data/test-cases/28a9bedc22c54787.json
new file mode 100644
index 00000000000..a695f797d08
--- /dev/null
+++ b/allure-report/data/test-cases/28a9bedc22c54787.json
@@ -0,0 +1 @@
+{"uid":"28a9bedc22c54787","name":"Testing 'sum_triangular_numbers' with positive numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_positive_numbers","historyId":"135e62f837ca5fe30ddfd2ad875e089b","time":{"start":1732764220741,"stop":1732764220741,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with positive numbers\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"419d7e1cf9a3c9b","name":"stdout","source":"419d7e1cf9a3c9b.txt","type":"text/plain","size":1127}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Help the bookseller !"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"9ee9ff331756b11e.json","parameterValues":[]} \ No newline at end of file +{"uid":"296f86e34803d6c1","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"efdc700a12236023","name":"stdout","source":"efdc700a12236023.txt","type":"text/plain","size":1127}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Help the bookseller !"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"296f86e34803d6c1.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2991adec6435da10.json b/allure-report/data/test-cases/2991adec6435da10.json new file mode 100644 index 00000000000..1a24b688d29 --- /dev/null +++ b/allure-report/data/test-cases/2991adec6435da10.json @@ -0,0 +1 @@ +{"uid":"2991adec6435da10","name":"Testing 'count_sheeps' function: bad input","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_bad_input","historyId":"4837bd231004cf7ec289887c52c12796","time":{"start":1732764220892,"stop":1732764220893,"duration":1},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like null/undefined\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"be7449bab7c02e56","name":"stdout","source":"be7449bab7c02e56.txt","type":"text/plain","size":949}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"5319ceacad5a43bc.json","parameterValues":[]} \ No newline at end of file +{"uid":"2ac4d21875a44bdb","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6362c8f15fc6c9c0","name":"stdout","source":"6362c8f15fc6c9c0.txt","type":"text/plain","size":949}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"2ac4d21875a44bdb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9dc85df7fba3a78e.json b/allure-report/data/test-cases/2ba00773a1bfae2e.json similarity index 61% rename from allure-report/data/test-cases/9dc85df7fba3a78e.json rename to allure-report/data/test-cases/2ba00773a1bfae2e.json index 00e0bf0f35f..fe9085acb97 100644 --- a/allure-report/data/test-cases/9dc85df7fba3a78e.json +++ b/allure-report/data/test-cases/2ba00773a1bfae2e.json @@ -1 +1 @@ -{"uid":"9dc85df7fba3a78e","name":"a an b are positive numbers","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_positive_numbers","historyId":"d52901f553e103c17fa73d8148d8b604","time":{"start":1724733474179,"stop":1724733474179,"duration":0},"description":"\n a an b are positive numbers\n :return:\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"36a84ce1aa4434a","name":"stdout","source":"36a84ce1aa4434a.txt","type":"text/plain","size":931}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MEMOIZATION"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"2c53cc9448de91f2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5d1981370251e5ca.json b/allure-report/data/test-cases/2c7af88777002151.json similarity index 71% rename from allure-report/data/test-cases/5d1981370251e5ca.json rename to allure-report/data/test-cases/2c7af88777002151.json index 3679199e02e..70cc3b8be7a 100644 --- a/allure-report/data/test-cases/5d1981370251e5ca.json +++ b/allure-report/data/test-cases/2c7af88777002151.json @@ -1 +1 @@ -{"uid":"5d1981370251e5ca","name":"Testing first_non_repeated function with various inputs","fullName":"kyu_7.the_first_non_repeated_character_in_string.test_first_non_repeated.FirstNonRepeatedTestCase#test_first_non_repeated","historyId":"9398abf0c9f75b70331fc87dcc2b8a7f","time":{"start":1724733474507,"stop":1724733474507,"duration":0},"description":"\n Testing first_non_repeated function\n :return:\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ff2bf17d38e7cc3b","name":"stdout","source":"ff2bf17d38e7cc3b.txt","type":"text/plain","size":277}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"7362d176d35d3813.json","parameterValues":[]} \ No newline at end of file +{"uid":"2da97da2ac2c9bbd","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b7eae48ecc824334","name":"stdout","source":"b7eae48ecc824334.txt","type":"text/plain","size":277}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1724735127922,"stop":1724735127922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"2da97da2ac2c9bbd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/462780a7368c9ffd.json b/allure-report/data/test-cases/2dcba5fbac259354.json similarity index 65% rename from allure-report/data/test-cases/462780a7368c9ffd.json rename to allure-report/data/test-cases/2dcba5fbac259354.json index 92ec3bbd124..25f89bd9b2e 100644 --- a/allure-report/data/test-cases/462780a7368c9ffd.json +++ b/allure-report/data/test-cases/2dcba5fbac259354.json @@ -1 +1 @@ -{"uid":"462780a7368c9ffd","name":"XOR logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_xor","historyId":"80fa996da1344642e95c3c1d2f315df1","time":{"start":1724735129586,"stop":1724735129602,"duration":16},"description":"\n Exclusive or or exclusive disjunction is a\n logical operation that outputs true only when\n inputs differ (one is true, the other is false).\n\n XOR outputs true whenever the inputs differ:\n\n Source:\n https://en.wikipedia.org/wiki/Exclusive_or\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1732428195706,"stop":1732428195706,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing likes function with various test data\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428195706,"stop":1732428195706,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1732428195708,"stop":1732428195708,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Who likes it?"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1bdb6e0764902ab4","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}},{"uid":"8a9b52813983814b","status":"passed","time":{"start":1724733474132,"stop":1724733474132,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d7357eaa8c15ec47","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}},{"uid":"57946e73be805e2a","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"fb237eeb673713e3.json","parameterValues":[]} \ No newline at end of file +{"uid":"2e0eb113649e95e6","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1732428195706,"stop":1732428195706,"duration":0},"description":"\n Testing likes function with various test data\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1732428195706,"stop":1732428195706,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing likes function with various test data\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428195706,"stop":1732428195706,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1732428195708,"stop":1732428195708,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Who likes it?"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"2e0eb113649e95e6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a770e6ac7d91604a.json b/allure-report/data/test-cases/2ee59d9a8c304f3b.json similarity index 61% rename from allure-report/data/test-cases/a770e6ac7d91604a.json rename to allure-report/data/test-cases/2ee59d9a8c304f3b.json index 70212a30c1c..79e5ef4af78 100644 --- a/allure-report/data/test-cases/a770e6ac7d91604a.json +++ b/allure-report/data/test-cases/2ee59d9a8c304f3b.json @@ -1 +1 @@ -{"uid":"a770e6ac7d91604a","name":"Testing 'save' function: positive","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_positive","historyId":"b1ff2214ba100eb1c8bc62e73e12889e","time":{"start":1732428195810,"stop":1732428195810,"duration":0},"description":"\n Testing 'save' function: positive\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1732764220552,"stop":1732764220552,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1732764220552,"stop":1732764220552,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isogram and verify the result","time":{"start":1732764220552,"stop":1732764220552,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string aba and verify the result","time":{"start":1732764220552,"stop":1732764220552,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string moOse and verify the result","time":{"start":1732764220552,"stop":1732764220552,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1732764220552,"stop":1732764220552,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the result","time":{"start":1732764220552,"stop":1732764220552,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1732764220556,"stop":1732764220556,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"7 kyu"},{"name":"story","value":"Isograms"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7567c87108e55931","status":"passed","time":{"start":1732428195861,"stop":1732428195861,"duration":0}},{"uid":"f6dea82ce819c148","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}},{"uid":"801881710b06074","status":"passed","time":{"start":1724733474304,"stop":1724733474304,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"2c6c8c712bf1892f","status":"passed","time":{"start":1732428195861,"stop":1732428195861,"duration":0}},{"uid":"cd862d92408a60a2","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}},{"uid":"3bd61bc704b417e2","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"30977e1fdeed6f0a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/49fb68289fb078f8.json b/allure-report/data/test-cases/30ac3ffad3316fea.json similarity index 71% rename from allure-report/data/test-cases/49fb68289fb078f8.json rename to allure-report/data/test-cases/30ac3ffad3316fea.json index 93c51e6b74f..46cb4807028 100644 --- a/allure-report/data/test-cases/49fb68289fb078f8.json +++ b/allure-report/data/test-cases/30ac3ffad3316fea.json @@ -1 +1 @@ -{"uid":"49fb68289fb078f8","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1724733472452,"stop":1724733472499,"duration":47},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"aef94a39bd8b19be","name":"stdout","source":"aef94a39bd8b19be.txt","type":"text/plain","size":1579}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"49fb68289fb078f8.json","parameterValues":[]} \ No newline at end of file +{"uid":"30ac3ffad3316fea","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1724733472452,"stop":1724733472499,"duration":47},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724733472452,"stop":1724733472452,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d21731264b505a67","name":"stdout","source":"d21731264b505a67.txt","type":"text/plain","size":1579}],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724733472499,"stop":1724733472499,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"30ac3ffad3316fea.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c74e320818fb9682.json b/allure-report/data/test-cases/30e62f45ee93d21d.json similarity index 79% rename from allure-report/data/test-cases/c74e320818fb9682.json rename to allure-report/data/test-cases/30e62f45ee93d21d.json index b39ba2d554b..81029f12f49 100644 --- a/allure-report/data/test-cases/c74e320818fb9682.json +++ b/allure-report/data/test-cases/30e62f45ee93d21d.json @@ -1 +1 @@ -{"uid":"c74e320818fb9682","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"c74e320818fb9682.json","parameterValues":[]} \ No newline at end of file +{"uid":"30e62f45ee93d21d","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"30e62f45ee93d21d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/30ebc2ebd440c488.json b/allure-report/data/test-cases/30ebc2ebd440c488.json new file mode 100644 index 00000000000..9065f7cacd3 --- /dev/null +++ b/allure-report/data/test-cases/30ebc2ebd440c488.json @@ -0,0 +1 @@ +{"uid":"30ebc2ebd440c488","name":"Testing is_palindrome function","fullName":"kyu_8.is_it_a_palindrome.test_is_palindrome.IsPalindromeTestCase#test_is_palindrome","historyId":"4967a6ca0665c8eeeec85898f8bda8f5","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"description":"\n Testing is_palindrome function\n with various test inputs\n\n The function should check if a\n given string (case insensitive)\n is a palindrome.\n ","descriptionHtml":" Testing using big test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 70, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"68a2b9760a533e02","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194190,"stop":1732428194190,"duration":0}},{"uid":"4d0958f9149b5791","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"a83b85c2e341a76c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"c42292a9c36c46f3","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194190,"stop":1732428194190,"duration":0}},{"uid":"a6bf4a932c1ec147","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"6827fd264cb4d263","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"31802a90aeba5e97.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/87c07388b10e55d5.json b/allure-report/data/test-cases/319c2fc51c0b8912.json
similarity index 65%
rename from allure-report/data/test-cases/87c07388b10e55d5.json
rename to allure-report/data/test-cases/319c2fc51c0b8912.json
index 70f3460103d..389b8057af5 100644
--- a/allure-report/data/test-cases/87c07388b10e55d5.json
+++ b/allure-report/data/test-cases/319c2fc51c0b8912.json
@@ -1 +1 @@
-{"uid":"87c07388b10e55d5","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724733472796,"stop":1724733472921,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472843,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472843,"stop":1724733472890,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724733472890,"stop":1724733472921,"duration":31},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8fe3e8aa201d424a","name":"stdout","source":"8fe3e8aa201d424a.txt","type":"text/plain","size":932}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OPTIMIZATION"},{"name":"feature","value":"Optimization"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Integers: Recreation One"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"87c07388b10e55d5.json","parameterValues":[]} \ No newline at end of file +{"uid":"319c2fc51c0b8912","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724733472796,"stop":1724733472921,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472796,"stop":1724733472843,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472843,"stop":1724733472890,"duration":47},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724733472890,"stop":1724733472921,"duration":31},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"506f9b1aa47477d8","name":"stdout","source":"506f9b1aa47477d8.txt","type":"text/plain","size":932}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OPTIMIZATION"},{"name":"feature","value":"Optimization"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Integers: Recreation One"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"319c2fc51c0b8912.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/39a19c10cf88efee.json b/allure-report/data/test-cases/31a691fa5a56c905.json similarity index 81% rename from allure-report/data/test-cases/39a19c10cf88efee.json rename to allure-report/data/test-cases/31a691fa5a56c905.json index 0ce48bf2a99..fd260f1806b 100644 --- a/allure-report/data/test-cases/39a19c10cf88efee.json +++ b/allure-report/data/test-cases/31a691fa5a56c905.json @@ -1 +1 @@ -{"uid":"39a19c10cf88efee","name":"Testing first_non_repeating_letter function","fullName":"kyu_5.first_non_repeating_character.test_first_non_repeating_letter.FirstNonRepeatingLetterTestCase#test_first_non_repeating_letter","historyId":"cff7d7f7b55b35458669cd92cb129d06","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"description":"\n Testing a function named first_non_repeating_letter\n that takes a string input, and returns the first character\n that is not repeated anywhere in the string.\n\n For example, if given the input 'stress', the function\n should return 't', since the letter t only occurs once\n in the string, and occurs first in the string.\n\n As an added challenge, upper- and lowercase letters are\n considered the same character, but the function should\n return the correct case for the initial letter. For example,\n the input 'sTreSS' should return 'T'.\n\n If a string contains all repeating characters, it should\n return an empty string (\"\") or None -- see sample tests.\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_line function\n :return:\n ","descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1732764220473,"stop":1732764220473,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732764220480,"stop":1732764220480,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"7 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"156fc08ab7167514","status":"passed","time":{"start":1732428195780,"stop":1732428195781,"duration":1}},{"uid":"45bc1447720343e5","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"d9e7bf55554cd705","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"28c03a6c5cc24cef","status":"passed","time":{"start":1732428195780,"stop":1732428195781,"duration":1}},{"uid":"2aa3a63b6fff605a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"fb3ce43e36479ba0","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"324d19209fbeb70d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/32703c37c2f9cfbd.json b/allure-report/data/test-cases/32703c37c2f9cfbd.json deleted file mode 100644 index e29f1c08659..00000000000 --- a/allure-report/data/test-cases/32703c37c2f9cfbd.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"32703c37c2f9cfbd","name":"AND logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_and","historyId":"49af4a8ebdc007fac4acbc085138b80e","time":{"start":1724735129586,"stop":1724735129586,"duration":0},"description":"\n And (∧) is the truth-functional\n operator of logical conjunction\n\n The and of a set of operands is true\n if and only if all of its operands are true.\n\n Source:\n https://en.wikipedia.org/wiki/Logical_conjunction\n\n :return:\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d8bbfaabd5a5300d","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428193918,"stop":1732428193918,"duration":0}},{"uid":"2488d38c1be516d6","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"9eac58d1342209e0","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"b7243d74fc99fb8b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428193918,"stop":1732428193918,"duration":0}},{"uid":"cf3552eb00513a1a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"f4c5ff18f0370583","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"32a39f3c0fa23567.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/9451201a4cae53ad.json b/allure-report/data/test-cases/330a0128cd73780c.json
similarity index 67%
rename from allure-report/data/test-cases/9451201a4cae53ad.json
rename to allure-report/data/test-cases/330a0128cd73780c.json
index 6e1f49f8a7b..fd135b288ce 100644
--- a/allure-report/data/test-cases/9451201a4cae53ad.json
+++ b/allure-report/data/test-cases/330a0128cd73780c.json
@@ -1 +1 @@
-{"uid":"9451201a4cae53ad","name":"Testing 'sum_triangular_numbers' with negative numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_negative_numbers","historyId":"4e553d5e3ff5fc5c21a746a843af96e5","time":{"start":1724733474476,"stop":1724733474476,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with negative numbers\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"77c66732e5fdad66","name":"stdout","source":"77c66732e5fdad66.txt","type":"text/plain","size":23}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"e427c3eece0f34c3.json","parameterValues":[]} \ No newline at end of file +{"uid":"335c39c3e0f7aa15","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"ec381cac44a14e7f","name":"stdout","source":"ec381cac44a14e7f.txt","type":"text/plain","size":23}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"335c39c3e0f7aa15.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/102a91ff9d2e2c1f.json b/allure-report/data/test-cases/3400d1d080e82f75.json similarity index 72% rename from allure-report/data/test-cases/102a91ff9d2e2c1f.json rename to allure-report/data/test-cases/3400d1d080e82f75.json index dadc1a7ca77..f6e95e28449 100644 --- a/allure-report/data/test-cases/102a91ff9d2e2c1f.json +++ b/allure-report/data/test-cases/3400d1d080e82f75.json @@ -1 +1 @@ -{"uid":"102a91ff9d2e2c1f","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1724733472421,"stop":1724733472437,"duration":16},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2fb64bb60201538c","name":"stdout","source":"2fb64bb60201538c.txt","type":"text/plain","size":225}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Strip Comments"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"102a91ff9d2e2c1f.json","parameterValues":[]} \ No newline at end of file +{"uid":"3400d1d080e82f75","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1724733472421,"stop":1724733472437,"duration":16},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a3653a5d01cb978a","name":"stdout","source":"a3653a5d01cb978a.txt","type":"text/plain","size":225}],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Strip Comments"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"3400d1d080e82f75.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c8870275fadfceea.json b/allure-report/data/test-cases/3460c7a02debe899.json similarity index 70% rename from allure-report/data/test-cases/c8870275fadfceea.json rename to allure-report/data/test-cases/3460c7a02debe899.json index 6e87679bc77..3f11ce9e088 100644 --- a/allure-report/data/test-cases/c8870275fadfceea.json +++ b/allure-report/data/test-cases/3460c7a02debe899.json @@ -1 +1 @@ -{"uid":"c8870275fadfceea","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"939b7ea8b8b69174","name":"stdout","source":"939b7ea8b8b69174.txt","type":"text/plain","size":2621}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"c8870275fadfceea.json","parameterValues":[]} \ No newline at end of file +{"uid":"3460c7a02debe899","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f9925186cd87d138","name":"stdout","source":"f9925186cd87d138.txt","type":"text/plain","size":2621}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724733473991,"stop":1724733473991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"3460c7a02debe899.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/34931ad2bd045d0c.json b/allure-report/data/test-cases/34931ad2bd045d0c.json new file mode 100644 index 00000000000..0c2357f35d4 --- /dev/null +++ b/allure-report/data/test-cases/34931ad2bd045d0c.json @@ -0,0 +1 @@ +{"uid":"34931ad2bd045d0c","name":"All chars are in upper case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_all_caps","historyId":"f47162ca0e9bacec154c9094fd33e635","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in upper case\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1732764219243,"stop":1732764219243,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing array_diff function\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219243,"stop":1732764219243,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219243,"stop":1732764219243,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219243,"stop":1732764219243,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219243,"stop":1732764219243,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219243,"stop":1732764219243,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1732764219245,"stop":1732764219245,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Array.diff"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"41a6baf598873d9b","status":"passed","time":{"start":1732428194558,"stop":1732428194558,"duration":0}},{"uid":"359cda8d66959d20","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"6a8f943df9cf325c","status":"passed","time":{"start":1724733473061,"stop":1724733473061,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"2bfddef765c09569","status":"passed","time":{"start":1732428194558,"stop":1732428194558,"duration":0}},{"uid":"dc29e000a4adcd25","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"f52a489cb0add672","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"354cda6601a7cded.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/35836d979e37575.json b/allure-report/data/test-cases/35836d979e37575.json deleted file mode 100644 index 1427de9d15c..00000000000 --- a/allure-report/data/test-cases/35836d979e37575.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"35836d979e37575","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"67751593ff534b14","name":"stdout","source":"67751593ff534b14.txt","type":"text/plain","size":1009}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"Snail"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"35836d979e37575.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4ea31191e1f5ab3b.json b/allure-report/data/test-cases/359cda8d66959d20.json similarity index 63% rename from allure-report/data/test-cases/4ea31191e1f5ab3b.json rename to allure-report/data/test-cases/359cda8d66959d20.json index 66743a7d8d5..e67d8051189 100644 --- a/allure-report/data/test-cases/4ea31191e1f5ab3b.json +++ b/allure-report/data/test-cases/359cda8d66959d20.json @@ -1 +1 @@ -{"uid":"4ea31191e1f5ab3b","name":"Testing array_diff function","fullName":"kyu_6.array_diff.test_array_diff.ArrayDiffTestCase#test_array_diff_function","historyId":"5e365f66b39a2fede4fe18a5cc569699","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3f3d8444cfb8c128","name":"stdout","source":"3f3d8444cfb8c128.txt","type":"text/plain","size":502}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"4ea31191e1f5ab3b.json","parameterValues":[]} \ No newline at end of file +{"uid":"359cda8d66959d20","name":"Testing array_diff function","fullName":"kyu_6.array_diff.test_array_diff.ArrayDiffTestCase#test_array_diff_function","historyId":"5e365f66b39a2fede4fe18a5cc569699","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e6e24d1199424ffc","name":"stdout","source":"e6e24d1199424ffc.txt","type":"text/plain","size":502}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"359cda8d66959d20.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/35f4051adfa3517.json b/allure-report/data/test-cases/35f4051adfa3517.json new file mode 100644 index 00000000000..2da0ec400d5 --- /dev/null +++ b/allure-report/data/test-cases/35f4051adfa3517.json @@ -0,0 +1 @@ +{"uid":"35f4051adfa3517","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_test","historyId":"eb0582ce0674121869dd4f6fce46e7f3","time":{"start":1724735129367,"stop":1724735129367,"duration":0},"description":"\n 3 is not a square number\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732764218886,"stop":1732764218886,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732764218891,"stop":1732764218891,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732764218912,"stop":1732764218912,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Find the safest places in town"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"574cb5d6827dca2a","status":"passed","time":{"start":1732428194237,"stop":1732428194238,"duration":1}},{"uid":"f17cc6d65b0932fd","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"472edec34fd4cc19","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"2b76b55d8c8f82d1","status":"passed","time":{"start":1732428194237,"stop":1732428194238,"duration":1}},{"uid":"614b9e2de4457676","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"e798d2f5cc38e024","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"37c27a38809b08b4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/38365b0f6f350ca5.json b/allure-report/data/test-cases/38365b0f6f350ca5.json deleted file mode 100644 index 399ae11c850..00000000000 --- a/allure-report/data/test-cases/38365b0f6f350ca5.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"38365b0f6f350ca5","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1ff678a4c7734b0","name":"stdout","source":"1ff678a4c7734b0.txt","type":"text/plain","size":554}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"38365b0f6f350ca5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ea156c7340f7150f.json b/allure-report/data/test-cases/383972b39eec664a.json similarity index 67% rename from allure-report/data/test-cases/ea156c7340f7150f.json rename to allure-report/data/test-cases/383972b39eec664a.json index 9eaa13e8f4e..6d947e30636 100644 --- a/allure-report/data/test-cases/ea156c7340f7150f.json +++ b/allure-report/data/test-cases/383972b39eec664a.json @@ -1 +1 @@ -{"uid":"ea156c7340f7150f","name":"String with no duplicate chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_dup_none","historyId":"a2426de0b4808429aff451df95bbdc21","time":{"start":1724733473929,"stop":1724733473929,"duration":0},"description":"\n Test string with no duplicate chars\n :return:\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"537ecc9a719af32f","name":"stdout","source":"537ecc9a719af32f.txt","type":"text/plain","size":225}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Strip Comments"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"863d9e582b6f3de4.json","parameterValues":[]} \ No newline at end of file +{"uid":"395a8f7cfcd6a2c9","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1724735127282,"stop":1724735127297,"duration":15},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"96d9a9c4b2d76831","name":"stdout","source":"96d9a9c4b2d76831.txt","type":"text/plain","size":225}],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127297,"stop":1724735127297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Strip Comments"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"395a8f7cfcd6a2c9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6fbd93f1e3abe9a5.json b/allure-report/data/test-cases/3a617c2d20fe6a0a.json similarity index 75% rename from allure-report/data/test-cases/6fbd93f1e3abe9a5.json rename to allure-report/data/test-cases/3a617c2d20fe6a0a.json index 0e31b0f3103..41d314a2d81 100644 --- a/allure-report/data/test-cases/6fbd93f1e3abe9a5.json +++ b/allure-report/data/test-cases/3a617c2d20fe6a0a.json @@ -1 +1 @@ -{"uid":"6fbd93f1e3abe9a5","name":"Testing the 'solution' function","fullName":"kyu_6.multiples_of_3_or_5.test_solution.SolutionTestCase#test_solution","historyId":"c387db789a67b80c29f3c3ba2e6c9bce","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"description":"\n Testing solution function\n\n If we list all the natural numbers below 10\n that are multiples of 3 or 5, we get 3, 5, 6 and 9.\n The sum of these multiples is 23.\n\n Finish the solution so that it returns the sum of\n all the multiples of 3 or 5 below the number passed in.\n\n Note: If the number is a multiple of both 3 and 5,\n only count it once.\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"b94b97d784c6cf01","name":"stdout","source":"b94b97d784c6cf01.txt","type":"text/plain","size":117}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"6f0b2af516b0f755.json","parameterValues":[]} \ No newline at end of file +{"uid":"3b2be2c8b8f3d0bb","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"47ad300a7de26866","name":"stdout","source":"47ad300a7de26866.txt","type":"text/plain","size":117}],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724733474975,"stop":1724733474975,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"3b2be2c8b8f3d0bb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3b580876a88f5382.json b/allure-report/data/test-cases/3b453b26a6476828.json similarity index 67% rename from allure-report/data/test-cases/3b580876a88f5382.json rename to allure-report/data/test-cases/3b453b26a6476828.json index 39ea682937b..2315558b8f5 100644 --- a/allure-report/data/test-cases/3b580876a88f5382.json +++ b/allure-report/data/test-cases/3b453b26a6476828.json @@ -1 +1 @@ -{"uid":"3b580876a88f5382","name":"Testing 'sum_triangular_numbers' with zero","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_zero","historyId":"fc1061f17dd61adf726ad7c2bb23539c","time":{"start":1724735129321,"stop":1724735129321,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with zero as an input\n :return:\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1732764218673,"stop":1732764218673,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732764218673,"stop":1732764218673,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732764218673,"stop":1732764218673,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732764218673,"stop":1732764218673,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732764218673,"stop":1732764218673,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732764218673,"stop":1732764218673,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732764218673,"stop":1732764218673,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1732764218676,"stop":1732764218676,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Strings Mix"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d36e2f5707d2a6d3","status":"passed","time":{"start":1732428194023,"stop":1732428194025,"duration":2}},{"uid":"9ee094a1f359821e","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}},{"uid":"584f8bdd5c7f3c16","status":"passed","time":{"start":1724733472421,"stop":1724733472421,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"2cc2dcb2d1d8eb43","status":"passed","time":{"start":1732428194023,"stop":1732428194025,"duration":2}},{"uid":"2460353038ce1955","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}},{"uid":"afdaa298aab7eba8","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"3b9e344534b3c5db.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9c2fc5bac7417dd0.json b/allure-report/data/test-cases/3bb063d5045f38b5.json similarity index 68% rename from allure-report/data/test-cases/9c2fc5bac7417dd0.json rename to allure-report/data/test-cases/3bb063d5045f38b5.json index 1291c78d9f5..c7638b5b85c 100644 --- a/allure-report/data/test-cases/9c2fc5bac7417dd0.json +++ b/allure-report/data/test-cases/3bb063d5045f38b5.json @@ -1 +1 @@ -{"uid":"9c2fc5bac7417dd0","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d0b96f0ad42d1de6","name":"stdout","source":"d0b96f0ad42d1de6.txt","type":"text/plain","size":67}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"9c2fc5bac7417dd0.json","parameterValues":[]} \ No newline at end of file +{"uid":"3bb063d5045f38b5","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"66609ce44d720b41","name":"stdout","source":"66609ce44d720b41.txt","type":"text/plain","size":67}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"3bb063d5045f38b5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9ac6d40036941792.json b/allure-report/data/test-cases/3c275e4650ef1fcb.json similarity index 71% rename from allure-report/data/test-cases/9ac6d40036941792.json rename to allure-report/data/test-cases/3c275e4650ef1fcb.json index 38510786d0a..48f372862ea 100644 --- a/allure-report/data/test-cases/9ac6d40036941792.json +++ b/allure-report/data/test-cases/3c275e4650ef1fcb.json @@ -1 +1 @@ -{"uid":"9ac6d40036941792","name":"Should return 'Publish!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_publish","historyId":"b4a1fa278aa899a374ebad09960e6cca","time":{"start":1724735129711,"stop":1724735129711,"duration":0},"description":"\n If there are one or two good ideas,\n return 'Publish!',\n :return:\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1732764218790,"stop":1732764218790,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert training","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert battle","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1732764218791,"stop":1732764218791,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":12,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1732764218797,"stop":1732764218797,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"OOP"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"epic","value":"4 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"10f08e5166368fc8","status":"passed","time":{"start":1732428194141,"stop":1732428194141,"duration":0}},{"uid":"70c180d1e9f40ddc","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}},{"uid":"4941703c69aa6dd8","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"751027d0ac0cc021","status":"passed","time":{"start":1732428194141,"stop":1732428194141,"duration":0}},{"uid":"37b95a78feb35857","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}},{"uid":"bc3230f80ad8864d","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"3d05de3d43cf437d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/256a10c9792b808f.json b/allure-report/data/test-cases/3d09efb523dadc81.json similarity index 51% rename from allure-report/data/test-cases/256a10c9792b808f.json rename to allure-report/data/test-cases/3d09efb523dadc81.json index f889295b23f..6b7d11c1d48 100644 --- a/allure-report/data/test-cases/256a10c9792b808f.json +++ b/allure-report/data/test-cases/3d09efb523dadc81.json @@ -1 +1 @@ -{"uid":"256a10c9792b808f","name":"Testing 'letter_count' function","fullName":"kyu_6.count_letters_in_string.test_count_letters_in_string.CountLettersInStringTestCase#test_count_letters_in_string","historyId":"04bb543ec741bd163e341a33a1623692","time":{"start":1732428194628,"stop":1732428194628,"duration":0},"description":"\n Testing 'letter_count' function\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1732764220916,"stop":1732764220916,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1732764220916,"stop":1732764220916,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1732764220916,"stop":1732764220916,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1732764220916,"stop":1732764220916,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1732764220916,"stop":1732764220916,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1732764220922,"stop":1732764220922,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"epic","value":"8 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"696e651c40149097","status":"passed","time":{"start":1732428196156,"stop":1732428196156,"duration":0}},{"uid":"7fb0d954404a7411","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}},{"uid":"efdfaccb93c4c6b4","status":"passed","time":{"start":1724733474632,"stop":1724733474632,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"fda81d5edcbfeda5","status":"passed","time":{"start":1732428196156,"stop":1732428196156,"duration":0}},{"uid":"9f7fc4731241a976","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}},{"uid":"cd298347a8b67e93","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"3d40466198fa34e6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3d4ef3b1faaf3c9d.json b/allure-report/data/test-cases/3d4ef3b1faaf3c9d.json new file mode 100644 index 00000000000..4dbb70b07d8 --- /dev/null +++ b/allure-report/data/test-cases/3d4ef3b1faaf3c9d.json @@ -0,0 +1 @@ +{"uid":"3d4ef3b1faaf3c9d","name":"Testing 'solution' function","fullName":"kyu_7.pull_your_words_together_man.test_sentencify.SentencifyTestCase#test_sentencify","historyId":"5821e6355bce2a3bf46d4ce3e55de034","time":{"start":1724735129196,"stop":1724735129196,"duration":0},"description":"\n Testing 'sentencify' function.\n\n The function should:\n\n 1. Capitalise the first letter of the first word.\n 2. Add a period (.) to the end of the sentence.\n 3. Join the words into a complete string, with spaces.\n 4. Do no other manipulation on the words.\n\n :return:\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"77adc248069b48d7","name":"stdout","source":"77adc248069b48d7.txt","type":"text/plain","size":410}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"3d4f8cb2de087cf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3de1512f067d459d.json b/allure-report/data/test-cases/3de1512f067d459d.json new file mode 100644 index 00000000000..cfad75712fa --- /dev/null +++ b/allure-report/data/test-cases/3de1512f067d459d.json @@ -0,0 +1 @@ +{"uid":"3de1512f067d459d","name":"Testing 'generate_hashtag' function","fullName":"kyu_5.the_hashtag_generator.test_generate_hashtag.GenerateHashtagTestCase#test_generate_hashtag","historyId":"ff2324e4a058a6c42486fd5aff532ecf","time":{"start":1732764219193,"stop":1732764219193,"duration":0},"description":"\n Testing 'generate_hashtag' function\n ","descriptionHtml":"The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732764221024,"stop":1732764221024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732764221024,"stop":1732764221024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732764221042,"stop":1732764221042,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Math"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"fe07573cd07e1ed8","status":"passed","time":{"start":1732428196238,"stop":1732428196239,"duration":1}},{"uid":"b8bd7a062c96fe90","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"bcdd15975118f527","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"2951c359ba3fd421","status":"passed","time":{"start":1732428196238,"stop":1732428196239,"duration":1}},{"uid":"972d0622d29729c4","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"2c2a3e42bb3933c8","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"3de5bbe9e7cab5b6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3e564e38813f1539.json b/allure-report/data/test-cases/3e564e38813f1539.json new file mode 100644 index 00000000000..1b895657b94 --- /dev/null +++ b/allure-report/data/test-cases/3e564e38813f1539.json @@ -0,0 +1 @@ +{"uid":"3e564e38813f1539","name":"Testing Walker class - position property from negative grids","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1732764218569,"stop":1732764218569,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":"Testing position property based on negative grids.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":true,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase","time":{"start":1732764218568,"stop":1732764218569,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":"Testing position property based on negative grids.
","status":"passed","steps":[{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218569,"stop":1732764218569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218569,"stop":1732764218569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218569,"stop":1732764218569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218569,"stop":1732764218569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218569,"stop":1732764218569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase::0","time":{"start":1732764218576,"stop":1732764218576,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"46ad98eaed470ea7","status":"passed","time":{"start":1732428193927,"stop":1732428193927,"duration":0}},{"uid":"d34aca89a8362e7c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"ee3233c4ab89c7ec","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":2,"unknown":0,"total":4},"items":[{"uid":"a76c277b6c0b5940","status":"passed","time":{"start":1732428193927,"stop":1732428193927,"duration":0}},{"uid":"801bdccb4e1aa824","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"92b17e5074e54ef7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"3e564e38813f1539.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a0d455d6bf21528b.json b/allure-report/data/test-cases/3e88e2d0381e105a.json similarity index 72% rename from allure-report/data/test-cases/a0d455d6bf21528b.json rename to allure-report/data/test-cases/3e88e2d0381e105a.json index ebf9801dd25..32741e8bba0 100644 --- a/allure-report/data/test-cases/a0d455d6bf21528b.json +++ b/allure-report/data/test-cases/3e88e2d0381e105a.json @@ -1 +1 @@ -{"uid":"a0d455d6bf21528b","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ffe9d790c546ddb7","name":"stdout","source":"ffe9d790c546ddb7.txt","type":"text/plain","size":230}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"a0d455d6bf21528b.json","parameterValues":[]} \ No newline at end of file +{"uid":"3e88e2d0381e105a","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a93887f366c469bf","name":"stdout","source":"a93887f366c469bf.txt","type":"text/plain","size":230}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"3e88e2d0381e105a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3ead41117d0ad5b6.json b/allure-report/data/test-cases/3ead41117d0ad5b6.json new file mode 100644 index 00000000000..c74e5f87d88 --- /dev/null +++ b/allure-report/data/test-cases/3ead41117d0ad5b6.json @@ -0,0 +1 @@ +{"uid":"3ead41117d0ad5b6","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1732764220845,"stop":1732764220845,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1732764220845,"stop":1732764220845,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1732764220845,"stop":1732764220845,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1732764220845,"stop":1732764220845,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1732764220845,"stop":1732764220845,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1732764220845,"stop":1732764220845,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1732764220845,"stop":1732764220845,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1732764220845,"stop":1732764220845,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1732764220847,"stop":1732764220847,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Numbers"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"864737f712b002ec","status":"passed","time":{"start":1732428196101,"stop":1732428196101,"duration":0}},{"uid":"3fe8a02ede1e6532","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}},{"uid":"65bb39f46c25941f","status":"passed","time":{"start":1724733474569,"stop":1724733474569,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"c7e963fd1c95dafe","status":"passed","time":{"start":1732428196101,"stop":1732428196101,"duration":0}},{"uid":"d3037fd25424c6f3","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}},{"uid":"1d2c6842ef40288f","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"3ead41117d0ad5b6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3f3bfc03f90689c3.json b/allure-report/data/test-cases/3f3bfc03f90689c3.json new file mode 100644 index 00000000000..17c719082c7 --- /dev/null +++ b/allure-report/data/test-cases/3f3bfc03f90689c3.json @@ -0,0 +1 @@ +{"uid":"3f3bfc03f90689c3","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d4f2ea957f6fd3d1","name":"stdout","source":"d4f2ea957f6fd3d1.txt","type":"text/plain","size":1009}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"Snail"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"3f3bfc03f90689c3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1532fae746d0bb3a.json b/allure-report/data/test-cases/3f678007c09ea2b5.json similarity index 54% rename from allure-report/data/test-cases/1532fae746d0bb3a.json rename to allure-report/data/test-cases/3f678007c09ea2b5.json index 0a104a4165d..d4213cd75e7 100644 --- a/allure-report/data/test-cases/1532fae746d0bb3a.json +++ b/allure-report/data/test-cases/3f678007c09ea2b5.json @@ -1 +1 @@ -{"uid":"1532fae746d0bb3a","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1732428194667,"stop":1732428194668,"duration":1},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194667,"stop":1732428194667,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Insert items to the list","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9f02852e3aa10b6d","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"693d19da33d622de","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2c78d4954ac14f9e","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"93b3042e12ae0dc2","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"1532fae746d0bb3a.json","parameterValues":[]} \ No newline at end of file +{"uid":"3f678007c09ea2b5","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1732428194667,"stop":1732428194668,"duration":1},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194667,"stop":1732428194667,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Insert items to the list","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194668,"stop":1732428194668,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"3f678007c09ea2b5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3fe8a02ede1e6532.json b/allure-report/data/test-cases/3fe8a02ede1e6532.json new file mode 100644 index 00000000000..b13ce6aa628 --- /dev/null +++ b/allure-report/data/test-cases/3fe8a02ede1e6532.json @@ -0,0 +1 @@ +{"uid":"3fe8a02ede1e6532","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"763b805ca97b9cb4","name":"stdout","source":"763b805ca97b9cb4.txt","type":"text/plain","size":410}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724735129383,"stop":1724735129383,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"3fe8a02ede1e6532.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3ff87d981594c6f7.json b/allure-report/data/test-cases/3ff87d981594c6f7.json new file mode 100644 index 00000000000..853a1ca8f99 --- /dev/null +++ b/allure-report/data/test-cases/3ff87d981594c6f7.json @@ -0,0 +1 @@ +{"uid":"3ff87d981594c6f7","name":"Testing password function","fullName":"kyu_7.password_validator.test_password.PasswordTestCase#test_password","historyId":"aaef6593296fd19246b6caa71f38ecab","time":{"start":1732764220596,"stop":1732764220597,"duration":1},"description":"\n Testing password function with various test inputs\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e13819432a0a8bbc","name":"stdout","source":"e13819432a0a8bbc.txt","type":"text/plain","size":23}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"c8c44a676a12b5c6.json","parameterValues":[]} \ No newline at end of file +{"uid":"406377324fdf0256","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f2a9e45ebf48d755","name":"stdout","source":"f2a9e45ebf48d755.txt","type":"text/plain","size":23}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"406377324fdf0256.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/40819c186d07d3de.json b/allure-report/data/test-cases/40819c186d07d3de.json deleted file mode 100644 index d17b36bb451..00000000000 --- a/allure-report/data/test-cases/40819c186d07d3de.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"40819c186d07d3de","name":"All chars are in upper case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_all_caps","historyId":"f47162ca0e9bacec154c9094fd33e635","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in upper case\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"660305aec4aa6e06","name":"stdout","source":"660305aec4aa6e06.txt","type":"text/plain","size":434}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"2980fd5af6447b30.json","parameterValues":[]} \ No newline at end of file +{"uid":"40a0fe54277654cc","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5f030da14b8e67d2","name":"stdout","source":"5f030da14b8e67d2.txt","type":"text/plain","size":434}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"40a0fe54277654cc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/40c938f8f83f34f7.json b/allure-report/data/test-cases/40c938f8f83f34f7.json deleted file mode 100644 index a8ce806400d..00000000000 --- a/allure-report/data/test-cases/40c938f8f83f34f7.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"40c938f8f83f34f7","name":"Testing to_table function","fullName":"kyu_6.array_to_html_table.test_list_to_html_table.ArrayToTableTestCase#test_array_to_table_function","historyId":"d7b951f3d87d7ec30599f08ae5567eb7","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"description":"\n Testing to_table with various test data\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1732428194566,"stop":1732428194566,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing to_table with various test data\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1732428194569,"stop":1732428194569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7d905be84b5c0b77","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"16a9ca9919e5cef5","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"e6a3da330525d2f4","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"b78c37ec3b0f496f","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"40c938f8f83f34f7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/413fd3063d3e7dc4.json b/allure-report/data/test-cases/413fd3063d3e7dc4.json deleted file mode 100644 index ed82539be85..00000000000 --- a/allure-report/data/test-cases/413fd3063d3e7dc4.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"413fd3063d3e7dc4","name":"Testing Walker class - position property from positive grids","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1732428193933,"stop":1732428193934,"duration":1},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":"Testing position property based on positive grids.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":true,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":"Testing position property based on positive grids.
","status":"passed","steps":[{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase::0","time":{"start":1732428193935,"stop":1732428193935,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"85df8de56a96ab7c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"af4da168bd187f62","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":1,"unknown":0,"total":3},"items":[{"uid":"ee4f0501c1152713","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"3edaeb1c9114b312","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"413fd3063d3e7dc4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/41668c3c4e1a677a.json b/allure-report/data/test-cases/41668c3c4e1a677a.json new file mode 100644 index 00000000000..3fd7d85265a --- /dev/null +++ b/allure-report/data/test-cases/41668c3c4e1a677a.json @@ -0,0 +1 @@ +{"uid":"41668c3c4e1a677a","name":"Testing the 'solution' function","fullName":"kyu_6.multiples_of_3_or_5.test_solution.SolutionTestCase#test_solution","historyId":"c387db789a67b80c29f3c3ba2e6c9bce","time":{"start":1732764220213,"stop":1732764220213,"duration":0},"description":"\n Testing solution function\n\n If we list all the natural numbers below 10\n that are multiples of 3 or 5, we get 3, 5, 6 and 9.\n The sum of these multiples is 23.\n\n Finish the solution so that it returns the sum of\n all the multiples of 3 or 5 below the number passed in.\n\n Note: If the number is a multiple of both 3 and 5,\n only count it once.\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1732764220293,"stop":1732764220293,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing odd_row function with various test data\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1732764220293,"stop":1732764220293,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1732764220293,"stop":1732764220293,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1732764220293,"stop":1732764220293,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1732764220293,"stop":1732764220293,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1732764220293,"stop":1732764220293,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1732764220295,"stop":1732764220295,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Performance"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"story","value":"Row of the odd triangle"},{"name":"tag","value":"PERFORMANCE"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"bb7d4237e3a80dd7","status":"passed","time":{"start":1732428195616,"stop":1732428195616,"duration":0}},{"uid":"1be5b98a41807de8","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}},{"uid":"b7108f3053cbc60d","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"59b1922c33f3ac65","status":"passed","time":{"start":1732428195616,"stop":1732428195616,"duration":0}},{"uid":"9b82a842fdc9b867","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}},{"uid":"4c3877c30e625752","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}}]},"tags":["PERFORMANCE","ALGORITHMS"]},"source":"416bb0c0ac58f7b6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2bfddef765c09569.json b/allure-report/data/test-cases/41a6baf598873d9b.json similarity index 57% rename from allure-report/data/test-cases/2bfddef765c09569.json rename to allure-report/data/test-cases/41a6baf598873d9b.json index 32eace7c761..d9e27cc99c5 100644 --- a/allure-report/data/test-cases/2bfddef765c09569.json +++ b/allure-report/data/test-cases/41a6baf598873d9b.json @@ -1 +1 @@ -{"uid":"2bfddef765c09569","name":"Testing array_diff function","fullName":"kyu_6.array_diff.test_array_diff.ArrayDiffTestCase#test_array_diff_function","historyId":"5e365f66b39a2fede4fe18a5cc569699","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"description":"\n Testing array_diff function\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing array_diff function\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1732428194561,"stop":1732428194561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array.diff"},{"name":"tag","value":"LISTS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4ea31191e1f5ab3b","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"ac81c5ec86387239","status":"passed","time":{"start":1724733473061,"stop":1724733473061,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"dc29e000a4adcd25","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"f52a489cb0add672","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"2bfddef765c09569.json","parameterValues":[]} \ No newline at end of file +{"uid":"41a6baf598873d9b","name":"Testing array_diff function","fullName":"kyu_6.array_diff.test_array_diff.ArrayDiffTestCase#test_array_diff_function","historyId":"5e365f66b39a2fede4fe18a5cc569699","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"description":"\n Testing array_diff function\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing array_diff function\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194558,"stop":1732428194558,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1732428194561,"stop":1732428194561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array.diff"},{"name":"tag","value":"LISTS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"41a6baf598873d9b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b67813f1cae4659e.json b/allure-report/data/test-cases/42358797bb03e774.json similarity index 63% rename from allure-report/data/test-cases/b67813f1cae4659e.json rename to allure-report/data/test-cases/42358797bb03e774.json index 3160ff15517..5517d4c47fd 100644 --- a/allure-report/data/test-cases/b67813f1cae4659e.json +++ b/allure-report/data/test-cases/42358797bb03e774.json @@ -1 +1 @@ -{"uid":"b67813f1cae4659e","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1732428196249,"stop":1732428196250,"duration":1},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196250,"stop":1732428196250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c74e320818fb9682","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}},{"uid":"5f2df3f2c9b86d77","status":"passed","time":{"start":1724733474757,"stop":1724733474757,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"cde5d1b46b10d7ac","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}},{"uid":"f5a3f0d4d035c3a4","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"b67813f1cae4659e.json","parameterValues":[]} \ No newline at end of file +{"uid":"42358797bb03e774","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1732428196249,"stop":1732428196250,"duration":1},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196250,"stop":1732428196250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"42358797bb03e774.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3cb4765f4f4fe8e7.json b/allure-report/data/test-cases/42452319aaa200ae.json similarity index 73% rename from allure-report/data/test-cases/3cb4765f4f4fe8e7.json rename to allure-report/data/test-cases/42452319aaa200ae.json index 853bbc5d9ba..4f8ba52cefa 100644 --- a/allure-report/data/test-cases/3cb4765f4f4fe8e7.json +++ b/allure-report/data/test-cases/42452319aaa200ae.json @@ -1 +1 @@ -{"uid":"3cb4765f4f4fe8e7","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"69b865faf74786aa","name":"stdout","source":"69b865faf74786aa.txt","type":"text/plain","size":22}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"3cb4765f4f4fe8e7.json","parameterValues":[]} \ No newline at end of file +{"uid":"42452319aaa200ae","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724735129758,"stop":1724735129758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fb983dadd4fd2138","name":"stdout","source":"fb983dadd4fd2138.txt","type":"text/plain","size":22}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"42452319aaa200ae.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4249127f6bff6f10.json b/allure-report/data/test-cases/4249127f6bff6f10.json new file mode 100644 index 00000000000..3dac48c7822 --- /dev/null +++ b/allure-report/data/test-cases/4249127f6bff6f10.json @@ -0,0 +1 @@ +{"uid":"4249127f6bff6f10","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1732764218611,"stop":1732764218616,"duration":5},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1732764218611,"stop":1732764218611,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":13,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1732764218617,"stop":1732764218617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATES/TIME"},{"name":"story","value":"Human readable duration format"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FORMATS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1e6c7d1c4189d9dd","status":"passed","time":{"start":1732428193967,"stop":1732428193967,"duration":0}},{"uid":"42bd5b348187136c","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"9f41894781b470ee","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"7cc0844ab5ecf216","status":"passed","time":{"start":1732428193967,"stop":1732428193967,"duration":0}},{"uid":"47f8df09a84d8337","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"409595d25cc5d60c","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"4249127f6bff6f10.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/428efcfcd43d2531.json b/allure-report/data/test-cases/428efcfcd43d2531.json deleted file mode 100644 index 61625af506b..00000000000 --- a/allure-report/data/test-cases/428efcfcd43d2531.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"428efcfcd43d2531","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string aba and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string moOse and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7bc78567c01b81e","name":"stdout","source":"7bc78567c01b81e.txt","type":"text/plain","size":401}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"428efcfcd43d2531.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/31050b40d7651adc.json b/allure-report/data/test-cases/42bd5b348187136c.json similarity index 68% rename from allure-report/data/test-cases/31050b40d7651adc.json rename to allure-report/data/test-cases/42bd5b348187136c.json index 4c0699ed4e2..6e1d91e5384 100644 --- a/allure-report/data/test-cases/31050b40d7651adc.json +++ b/allure-report/data/test-cases/42bd5b348187136c.json @@ -1 +1 @@ -{"uid":"31050b40d7651adc","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"12f3e703f687ed41","name":"stdout","source":"12f3e703f687ed41.txt","type":"text/plain","size":1515}],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Human readable duration format"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"31050b40d7651adc.json","parameterValues":[]} \ No newline at end of file +{"uid":"42bd5b348187136c","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"70a5653f29871a87","name":"stdout","source":"70a5653f29871a87.txt","type":"text/plain","size":1515}],"parameters":[],"stepsCount":13,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Human readable duration format"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"42bd5b348187136c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6207ccc30173aa77.json b/allure-report/data/test-cases/437936b48694b75d.json similarity index 64% rename from allure-report/data/test-cases/6207ccc30173aa77.json rename to allure-report/data/test-cases/437936b48694b75d.json index bc15b602d44..ee945bd5e4e 100644 --- a/allure-report/data/test-cases/6207ccc30173aa77.json +++ b/allure-report/data/test-cases/437936b48694b75d.json @@ -1 +1 @@ -{"uid":"6207ccc30173aa77","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d8b7ee3418e7b9e0","name":"stdout","source":"d8b7ee3418e7b9e0.txt","type":"text/plain","size":1093}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Disease Spread"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"6207ccc30173aa77.json","parameterValues":[]} \ No newline at end of file +{"uid":"437936b48694b75d","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"613c4bb712b376ab","name":"stdout","source":"613c4bb712b376ab.txt","type":"text/plain","size":1093}],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"story","value":"Disease Spread"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"437936b48694b75d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/43a8b37a1715c915.json b/allure-report/data/test-cases/43a8b37a1715c915.json new file mode 100644 index 00000000000..da38cbe4da7 --- /dev/null +++ b/allure-report/data/test-cases/43a8b37a1715c915.json @@ -0,0 +1 @@ +{"uid":"43a8b37a1715c915","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1732764218582,"stop":1732764218583,"duration":1},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1732764218582,"stop":1732764218582,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1732764218583,"stop":1732764218583,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1732764218583,"stop":1732764218583,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1732764218583,"stop":1732764218583,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1732764218583,"stop":1732764218583,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1732764218583,"stop":1732764218583,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1732764218584,"stop":1732764218584,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"aea343086c8abd68","status":"passed","time":{"start":1732428193941,"stop":1732428193942,"duration":1}},{"uid":"47cf0745ec1b0964","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"f207a08521ff3dd3","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"8dde6031964dc28f","status":"passed","time":{"start":1732428193941,"stop":1732428193942,"duration":1}},{"uid":"b1d54b76165521a0","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"164087ecc666d9a0","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"43a8b37a1715c915.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/77e868a9cd944330.json b/allure-report/data/test-cases/43c9c9efb1c04251.json similarity index 81% rename from allure-report/data/test-cases/77e868a9cd944330.json rename to allure-report/data/test-cases/43c9c9efb1c04251.json index 6f5d5844d72..fddd3883689 100644 --- a/allure-report/data/test-cases/77e868a9cd944330.json +++ b/allure-report/data/test-cases/43c9c9efb1c04251.json @@ -1 +1 @@ -{"uid":"77e868a9cd944330","name":"Testing 'feast' function","fullName":"kyu_8.the_feast_of_many_beasts.test_feast.FeastTestCase#test_feast","historyId":"963bc543b4e4096b877e161985d8949c","time":{"start":1724733474929,"stop":1724733474929,"duration":0},"description":"\n Testing 'feast' function with various test inputs\n\n Testing a function feast that takes the animal's\n name and dish as arguments and returns true or\n false to indicate whether the beast is allowed\n to bring the dish to the feast.\n\n Assume that beast and dish are always lowercase strings,\n and that each has at least two letters. beast and dish\n may contain hyphens and spaces, but these will not appear\n at the beginning or end of the string. They will not\n contain numerals.\n\n There is just one rule: the dish must start and end with\n the same letters as the animal's name. For example, the\n great blue heron is bringing garlic naan and the chickadee\n is bringing chocolate cake.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6ccd74e070792411","name":"stdout","source":"6ccd74e070792411.txt","type":"text/plain","size":371}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"d7eae685c38fccbb.json","parameterValues":[]} \ No newline at end of file +{"uid":"4430fa612ad99844","name":"Testing 'DefaultList' class: __getitem__","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_basic","historyId":"7dba0545991d74ec4981bfb3eea48559","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"491bdfb319cbef56","name":"stdout","source":"491bdfb319cbef56.txt","type":"text/plain","size":371}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"4430fa612ad99844.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4438dce845a8b680.json b/allure-report/data/test-cases/4438dce845a8b680.json new file mode 100644 index 00000000000..8ae581d8d19 --- /dev/null +++ b/allure-report/data/test-cases/4438dce845a8b680.json @@ -0,0 +1 @@ +{"uid":"4438dce845a8b680","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1732764219349,"stop":1732764219351,"duration":2},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732764219350,"stop":1732764219350,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1732764219350,"stop":1732764219350,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1732764219350,"stop":1732764219350,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an un-existing item and verify the result","time":{"start":1732764219350,"stop":1732764219350,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732764219359,"stop":1732764219359,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"story","value":"DefaultList"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"67c96b92db3f1ee1","status":"passed","time":{"start":1732428194672,"stop":1732428194672,"duration":0}},{"uid":"adbbb2c26291ccd5","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"582aa68275dac68e","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"d9328098007f6ade","status":"passed","time":{"start":1732428194672,"stop":1732428194672,"duration":0}},{"uid":"99a050e28b9f808c","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"a33fb2570aec1823","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"4438dce845a8b680.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2dc119e05306bc09.json b/allure-report/data/test-cases/44516baeffa03c9d.json similarity index 76% rename from allure-report/data/test-cases/2dc119e05306bc09.json rename to allure-report/data/test-cases/44516baeffa03c9d.json index 7dc6a7b3477..ef9415afc69 100644 --- a/allure-report/data/test-cases/2dc119e05306bc09.json +++ b/allure-report/data/test-cases/44516baeffa03c9d.json @@ -1 +1 @@ -{"uid":"2dc119e05306bc09","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"2dc119e05306bc09.json","parameterValues":[]} \ No newline at end of file +{"uid":"44516baeffa03c9d","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"44516baeffa03c9d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/44e584571b03be2.json b/allure-report/data/test-cases/44e584571b03be2.json new file mode 100644 index 00000000000..7007c32fac0 --- /dev/null +++ b/allure-report/data/test-cases/44e584571b03be2.json @@ -0,0 +1 @@ +{"uid":"44e584571b03be2","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have Dog arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 5 arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have good arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 50lb arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have brown arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"16068cef6801ede5","name":"stdout","source":"16068cef6801ede5.txt","type":"text/plain","size":148}],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Make Class"},{"name":"parentSuite","value":"Beginner"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"44e584571b03be2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/450fbb27e2067be4.json b/allure-report/data/test-cases/450fbb27e2067be4.json new file mode 100644 index 00000000000..3d313f39a58 --- /dev/null +++ b/allure-report/data/test-cases/450fbb27e2067be4.json @@ -0,0 +1 @@ +{"uid":"450fbb27e2067be4","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1732764218624,"stop":1732764218624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1732764218627,"stop":1732764218627,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"PARSING"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"FILTERING"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Most frequently used words in a text"},{"name":"tag","value":"RANKING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1f21450476aa4c9a","status":"passed","time":{"start":1732428193975,"stop":1732428193976,"duration":1}},{"uid":"65c772a236576a2d","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"4b28b33a131eefd9","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"f85ab0d3a8429db7","status":"passed","time":{"start":1732428193975,"stop":1732428193976,"duration":1}},{"uid":"c7c7f21adbc73706","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}},{"uid":"647dfe698e2a6fdb","status":"passed","time":{"start":1724735127219,"stop":1724735127219,"duration":0}}]},"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"450fbb27e2067be4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/45bc1447720343e5.json b/allure-report/data/test-cases/45bc1447720343e5.json new file mode 100644 index 00000000000..cbeb3833980 --- /dev/null +++ b/allure-report/data/test-cases/45bc1447720343e5.json @@ -0,0 +1 @@ +{"uid":"45bc1447720343e5","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"72a8521de031df4e","name":"stdout","source":"72a8521de031df4e.txt","type":"text/plain","size":554}],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"45bc1447720343e5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1bdb6e0764902ab4.json b/allure-report/data/test-cases/4617147ad7612076.json similarity index 74% rename from allure-report/data/test-cases/1bdb6e0764902ab4.json rename to allure-report/data/test-cases/4617147ad7612076.json index e23354733a3..312df6ccfaf 100644 --- a/allure-report/data/test-cases/1bdb6e0764902ab4.json +++ b/allure-report/data/test-cases/4617147ad7612076.json @@ -1 +1 @@ -{"uid":"1bdb6e0764902ab4","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e321f5d691b52e57","name":"stdout","source":"e321f5d691b52e57.txt","type":"text/plain","size":348}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Who likes it?"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"1bdb6e0764902ab4.json","parameterValues":[]} \ No newline at end of file +{"uid":"4617147ad7612076","name":"Testing likes function","fullName":"kyu_6.who_likes_it.test_likes_function.LikesTestCase#test_likes_function","historyId":"79c7b93ec42d8a40bc531e50834720ef","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3cf96ebaed3b737c","name":"stdout","source":"3cf96ebaed3b737c.txt","type":"text/plain","size":348}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1724735128992,"stop":1724735128992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Who likes it?"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"4617147ad7612076.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/46ad98eaed470ea7.json b/allure-report/data/test-cases/46ad98eaed470ea7.json new file mode 100644 index 00000000000..522266d6bec --- /dev/null +++ b/allure-report/data/test-cases/46ad98eaed470ea7.json @@ -0,0 +1 @@ +{"uid":"46ad98eaed470ea7","name":"Testing Walker class - position property from negative grids","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":"Testing position property based on negative grids.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":"Testing position property based on negative grids.
","status":"passed","steps":[{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase::0","time":{"start":1732428193935,"stop":1732428193935,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"46ad98eaed470ea7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1bef76bb610cc3bd.json b/allure-report/data/test-cases/46de5298b06a2e8f.json similarity index 71% rename from allure-report/data/test-cases/1bef76bb610cc3bd.json rename to allure-report/data/test-cases/46de5298b06a2e8f.json index 266c7fd85ff..5e4b0c87cb6 100644 --- a/allure-report/data/test-cases/1bef76bb610cc3bd.json +++ b/allure-report/data/test-cases/46de5298b06a2e8f.json @@ -1 +1 @@ -{"uid":"1bef76bb610cc3bd","name":"Should return 'Publish!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_publish","historyId":"b4a1fa278aa899a374ebad09960e6cca","time":{"start":1724733474960,"stop":1724733474960,"duration":0},"description":"\n If there are one or two good ideas,\n return 'Publish!',\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1732764221357,"stop":1732764221357,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1732764221358,"stop":1732764221358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1732764221363,"stop":1732764221363,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"71f8f5b376b254cf","status":"passed","time":{"start":1732428196482,"stop":1732428196482,"duration":0}},{"uid":"406377324fdf0256","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"335c39c3e0f7aa15","status":"passed","time":{"start":1724733475007,"stop":1724733475007,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"54bb63fb3736b8ae","status":"passed","time":{"start":1732428196482,"stop":1732428196482,"duration":0}},{"uid":"b97e3a9bf54f17f3","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"73d92f8f0c07772d","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"4710cc2182eb85cb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e17b710b1ca6cef6.json b/allure-report/data/test-cases/4719969d944ed48a.json similarity index 66% rename from allure-report/data/test-cases/e17b710b1ca6cef6.json rename to allure-report/data/test-cases/4719969d944ed48a.json index 278cdd5bda6..e9c98a9f57f 100644 --- a/allure-report/data/test-cases/e17b710b1ca6cef6.json +++ b/allure-report/data/test-cases/4719969d944ed48a.json @@ -1 +1 @@ -{"uid":"e17b710b1ca6cef6","name":"Testing decipher_this function","fullName":"kyu_6.decipher_this.test_decipher_this.DecipherThisTestCase#test_decipher_this","historyId":"ae3e8fd54712dd8496499b7bc14e7226","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"description":"\n Testing decipher_this function\n :param self:\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1905a023fe62d7a5","name":"stdout","source":"1905a023fe62d7a5.txt","type":"text/plain","size":326}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"a530698ca5ed066c.json","parameterValues":[]} \ No newline at end of file +{"uid":"472edec34fd4cc19","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"312dff4578efa314","name":"stdout","source":"312dff4578efa314.txt","type":"text/plain","size":326}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"472edec34fd4cc19.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4736c243443acbf6.json b/allure-report/data/test-cases/4736c243443acbf6.json new file mode 100644 index 00000000000..0e7220cd1a9 --- /dev/null +++ b/allure-report/data/test-cases/4736c243443acbf6.json @@ -0,0 +1 @@ +{"uid":"4736c243443acbf6","name":"Negative non consecutive number should be returned","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_negative","historyId":"f9c1f10fe995fd827dbc67efd6c689cb","time":{"start":1732764220941,"stop":1732764220941,"duration":0},"description":"\n non-consecutive is a negative number.\n :return:\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ff15e181fd0e6388","name":"stdout","source":"ff15e181fd0e6388.txt","type":"text/plain","size":1865}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"73a56012085cbb67.json","parameterValues":[]} \ No newline at end of file +{"uid":"47cf0745ec1b0964","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9970c74c966a73af","name":"stdout","source":"9970c74c966a73af.txt","type":"text/plain","size":1865}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"47cf0745ec1b0964.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4c7e13d0f61cf99a.json b/allure-report/data/test-cases/47f8dbee3cb403d3.json similarity index 71% rename from allure-report/data/test-cases/4c7e13d0f61cf99a.json rename to allure-report/data/test-cases/47f8dbee3cb403d3.json index 84e0dfe873b..0671d0641f5 100644 --- a/allure-report/data/test-cases/4c7e13d0f61cf99a.json +++ b/allure-report/data/test-cases/47f8dbee3cb403d3.json @@ -1 +1 @@ -{"uid":"4c7e13d0f61cf99a","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"df1294dda064bff1","name":"stdout","source":"df1294dda064bff1.txt","type":"text/plain","size":908}],"parameters":[],"hasContent":true,"stepsCount":14,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"FEATURES"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"PROGRAMMING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LANGUAGE","DECLARATIVE","REGULAR","EXPRESSIONS","FUNDAMENTALS","PROGRAMMING","FEATURES","ADVANCED"]},"source":"4c7e13d0f61cf99a.json","parameterValues":[]} \ No newline at end of file +{"uid":"47f8dbee3cb403d3","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b38075c83e7baebb","name":"stdout","source":"b38075c83e7baebb.txt","type":"text/plain","size":908}],"parameters":[],"stepsCount":14,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"FEATURES"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"PROGRAMMING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LANGUAGE","DECLARATIVE","REGULAR","EXPRESSIONS","FUNDAMENTALS","PROGRAMMING","FEATURES","ADVANCED"]},"source":"47f8dbee3cb403d3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e57068c00956ea02.json b/allure-report/data/test-cases/482801cdd802c850.json similarity index 70% rename from allure-report/data/test-cases/e57068c00956ea02.json rename to allure-report/data/test-cases/482801cdd802c850.json index 7afdc94f03e..0e80cdf7be8 100644 --- a/allure-report/data/test-cases/e57068c00956ea02.json +++ b/allure-report/data/test-cases/482801cdd802c850.json @@ -1 +1 @@ -{"uid":"e57068c00956ea02","name":"Testing move_zeros function","fullName":"kyu_5.moving_zeros_to_the_end.test_move_zeros.MoveZerosTestCase#test_move_zeros","historyId":"4d406a702da9fd827c8c4798d255a6cf","time":{"start":1724735127844,"stop":1724735127844,"duration":0},"description":"\n Test an algorithm that takes an array and moves all of the\n zeros to the end, preserving the order of the other elements.\n :return:\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1732764219205,"stop":1732764219205,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732764219206,"stop":1732764219207,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732764219207,"stop":1732764219207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732764219207,"stop":1732764219207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732764219207,"stop":1732764219207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732764219207,"stop":1732764219207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1732764219209,"stop":1732764219209,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAY"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5bc730ff95f1c205","status":"passed","time":{"start":1732428194528,"stop":1732428194528,"duration":0}},{"uid":"2da97da2ac2c9bbd","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}},{"uid":"1c33446eccccc45a","status":"passed","time":{"start":1724733473030,"stop":1724733473030,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"6e3ab906ce5621b5","status":"passed","time":{"start":1732428194528,"stop":1732428194528,"duration":0}},{"uid":"6cad203fab564c60","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}},{"uid":"63cbfe00daba1c69","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}}]},"tags":["ARRAY","ALGORITHMS"]},"source":"48e03b38164b77c2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/48fa5f91e3478c29.json b/allure-report/data/test-cases/48fa5f91e3478c29.json new file mode 100644 index 00000000000..74dbf170727 --- /dev/null +++ b/allure-report/data/test-cases/48fa5f91e3478c29.json @@ -0,0 +1 @@ +{"uid":"48fa5f91e3478c29","name":"Testing encrypt_this function","fullName":"kyu_6.encrypt_this.test_encrypt_this.EncryptThisTestCase#test_encrypt_this","historyId":"69a156fb0b04999e58427537301412d4","time":{"start":1732764220149,"stop":1732764220149,"duration":0},"description":"\n Testing encrypt_this function\n :param self:\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert training","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert battle","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c52989139561013a","name":"stdout","source":"c52989139561013a.txt","type":"text/plain","size":67}],"parameters":[],"hasContent":true,"stepsCount":12,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"286a2c6d22a3ea0b.json","parameterValues":[]} \ No newline at end of file +{"uid":"4941703c69aa6dd8","name":"Testing Warrior class >>> bruce_lee","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_bruce_lee","historyId":"7af7e9479cf2a47a636ae35231bacc9f","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert training","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert battle","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5d2b03d7ca85feb9","name":"stdout","source":"5d2b03d7ca85feb9.txt","type":"text/plain","size":67}],"parameters":[],"stepsCount":12,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"4941703c69aa6dd8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a3395496d8bde803.json b/allure-report/data/test-cases/494bc5055e76bf71.json similarity index 63% rename from allure-report/data/test-cases/a3395496d8bde803.json rename to allure-report/data/test-cases/494bc5055e76bf71.json index ac5f6af9837..e2a18d1f45a 100644 --- a/allure-report/data/test-cases/a3395496d8bde803.json +++ b/allure-report/data/test-cases/494bc5055e76bf71.json @@ -1 +1 @@ -{"uid":"a3395496d8bde803","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1732428194006,"stop":1732428194008,"duration":2},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1732428194005,"stop":1732428194005,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1732428194006,"stop":1732428194006,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1732428194006,"stop":1732428194006,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1732428194007,"stop":1732428194007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1732428194009,"stop":1732428194009,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f63a88604b1d062f","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"89c602359c6f109b","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"f80099cf6c294d2b","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"99f691b62c390084","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"a3395496d8bde803.json","parameterValues":[]} \ No newline at end of file +{"uid":"494bc5055e76bf71","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1732428194006,"stop":1732428194008,"duration":2},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1732428194005,"stop":1732428194005,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1732428194006,"stop":1732428194006,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1732428194006,"stop":1732428194006,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1732428194007,"stop":1732428194007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1732428194009,"stop":1732428194009,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"FORMATTING"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"494bc5055e76bf71.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cc1bd3cedb1bfef0.json b/allure-report/data/test-cases/497e27a7f74365e8.json similarity index 73% rename from allure-report/data/test-cases/cc1bd3cedb1bfef0.json rename to allure-report/data/test-cases/497e27a7f74365e8.json index 9feba626e70..d06cb04226a 100644 --- a/allure-report/data/test-cases/cc1bd3cedb1bfef0.json +++ b/allure-report/data/test-cases/497e27a7f74365e8.json @@ -1 +1 @@ -{"uid":"cc1bd3cedb1bfef0","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"10b8961e386c4fec","name":"stdout","source":"10b8961e386c4fec.txt","type":"text/plain","size":22}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"cc1bd3cedb1bfef0.json","parameterValues":[]} \ No newline at end of file +{"uid":"497e27a7f74365e8","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e255c73086be3d07","name":"stdout","source":"e255c73086be3d07.txt","type":"text/plain","size":22}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing is_prime util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"497e27a7f74365e8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/49ad6a9c0404421b.json b/allure-report/data/test-cases/49ad6a9c0404421b.json new file mode 100644 index 00000000000..eef75408f6e --- /dev/null +++ b/allure-report/data/test-cases/49ad6a9c0404421b.json @@ -0,0 +1 @@ +{"uid":"49ad6a9c0404421b","name":"All chars are in mixed case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_mixed","historyId":"d4bb68fb8c0e59fc03fed525cca43eb5","time":{"start":1732764219290,"stop":1732764219291,"duration":1},"description":"\n Testing letter_frequency function\n where all chars are in mixed case\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1732428195606,"stop":1732428195606,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test that a function that given a sequence of strings,\n groups the elements that can be obtained by rotating others,\n ignoring upper or lower cases.\n\n In the event that an element appears more than once in\n the input sequence, only one of them will be taken into\n account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1732428195610,"stop":1732428195610,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"PUZZLES"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4f1172fa5620cc18","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}},{"uid":"924a52587e7b2c82","status":"passed","time":{"start":1724733474054,"stop":1724733474054,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"8655885cb5db7a58","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}},{"uid":"578c3a6cd3e7e40f","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}}]},"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"25fd6f6c5cfe2b58.json","parameterValues":[]} \ No newline at end of file +{"uid":"4a6083b6c2f5cc4b","name":"Testing the 'group_cities' function","fullName":"kyu_6.rotate_the_letters_of_each_element.test_group_cities.GroupCitiesTestCase#test_group_cities","historyId":"0b146f7fbac52b042804286da8716f6b","time":{"start":1732428195606,"stop":1732428195607,"duration":1},"description":"\n Test that a function that given a sequence of strings,\n groups the elements that can be obtained by rotating others,\n ignoring upper or lower cases.\n\n In the event that an element appears more than once in\n the input sequence, only one of them will be taken into\n account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1732428195606,"stop":1732428195606,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test that a function that given a sequence of strings,\n groups the elements that can be obtained by rotating others,\n ignoring upper or lower cases.\n\n In the event that an element appears more than once in\n the input sequence, only one of them will be taken into\n account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195607,"stop":1732428195607,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1732428195610,"stop":1732428195610,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"PUZZLES"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"4a6083b6c2f5cc4b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4aa405db56695158.json b/allure-report/data/test-cases/4aa405db56695158.json deleted file mode 100644 index 0c8b095f8fb..00000000000 --- a/allure-report/data/test-cases/4aa405db56695158.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"4aa405db56695158","name":"All chars are in upper case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_all_caps","historyId":"f47162ca0e9bacec154c9094fd33e635","time":{"start":1724735127984,"stop":1724735128000,"duration":16},"description":"\n Testing letter_frequency function\n where all chars are in upper case\n :return:\n ","descriptionHtml":"Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Your message is a string containing space separated words.
You need to encrypt each word in the message using the following rules:
* The first letter needs to be converted to its ASCII code.
* The second letter needs to be switched with the last letter
Keepin' it simple: There are no special characters in input.
Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1732428194117,"stop":1732428194117,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7e5150fbd4a33237","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}},{"uid":"49fb68289fb078f8","status":"passed","time":{"start":1724733472452,"stop":1724733472499,"duration":47}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"82619e3fb0e84d4d","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}},{"uid":"521b14729542d5c4","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}}]},"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"aa08a95162404297.json","parameterValues":[]} \ No newline at end of file +{"uid":"4b22647a9cdd2bef","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1732428194048,"stop":1732428194108,"duration":60},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1732428194048,"stop":1732428194048,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1732428194108,"stop":1732428194108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1732428194117,"stop":1732428194117,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"4b22647a9cdd2bef.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4b28b33a131eefd9.json b/allure-report/data/test-cases/4b28b33a131eefd9.json new file mode 100644 index 00000000000..ea2633e0a82 --- /dev/null +++ b/allure-report/data/test-cases/4b28b33a131eefd9.json @@ -0,0 +1 @@ +{"uid":"4b28b33a131eefd9","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"64228c9b0b57911a","name":"stdout","source":"64228c9b0b57911a.txt","type":"text/plain","size":3097}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"PARSING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"RANKING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"feature","value":"String"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"4b28b33a131eefd9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4b2984e4fa36f94.json b/allure-report/data/test-cases/4b2984e4fa36f94.json new file mode 100644 index 00000000000..6e5883e8653 --- /dev/null +++ b/allure-report/data/test-cases/4b2984e4fa36f94.json @@ -0,0 +1 @@ +{"uid":"4b2984e4fa36f94","name":"Testing Walker class - position property from positive grids","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1732764218574,"stop":1732764218575,"duration":1},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":"Testing position property based on positive grids.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":true,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase","time":{"start":1732764218568,"stop":1732764218569,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":"Testing position property based on positive grids.
","status":"passed","steps":[{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218574,"stop":1732764218574,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218575,"stop":1732764218575,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218575,"stop":1732764218575,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218575,"stop":1732764218575,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732764218575,"stop":1732764218575,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase::0","time":{"start":1732764218576,"stop":1732764218576,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"c8da32e94b736fef","status":"passed","time":{"start":1732428193933,"stop":1732428193934,"duration":1}},{"uid":"a35155a27bb8937d","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"e9cabde1f2c64760","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":2,"unknown":0,"total":4},"items":[{"uid":"413fd3063d3e7dc4","status":"passed","time":{"start":1732428193933,"stop":1732428193934,"duration":1}},{"uid":"ee4f0501c1152713","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"3edaeb1c9114b312","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"4b2984e4fa36f94.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4b8d012f19a4e1e6.json b/allure-report/data/test-cases/4b8d012f19a4e1e6.json deleted file mode 100644 index 6525c429461..00000000000 --- a/allure-report/data/test-cases/4b8d012f19a4e1e6.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"4b8d012f19a4e1e6","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1724733473171,"stop":1724733473186,"duration":15},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Remove items from the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f66e1341a4df20a3","name":"stdout","source":"f66e1341a4df20a3.txt","type":"text/plain","size":254}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"4b8d012f19a4e1e6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4bb422e9ca9901c8.json b/allure-report/data/test-cases/4bb422e9ca9901c8.json deleted file mode 100644 index e548562848e..00000000000 --- a/allure-report/data/test-cases/4bb422e9ca9901c8.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"4bb422e9ca9901c8","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_test","historyId":"eb0582ce0674121869dd4f6fce46e7f3","time":{"start":1724735129367,"stop":1724735129367,"duration":0},"description":"\n 3 is not a square number\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e7750817bf2ce3d3","name":"stdout","source":"e7750817bf2ce3d3.txt","type":"text/plain","size":1093}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Disease Spread"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"b890a6fea083097f.json","parameterValues":[]} \ No newline at end of file +{"uid":"4c31a5ec99c6ca69","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fceb9ab1ca4c439c","name":"stdout","source":"fceb9ab1ca4c439c.txt","type":"text/plain","size":1093}],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Disease Spread"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"4c31a5ec99c6ca69.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4c5cc35d3de0d6f4.json b/allure-report/data/test-cases/4c5cc35d3de0d6f4.json new file mode 100644 index 00000000000..568216d8bed --- /dev/null +++ b/allure-report/data/test-cases/4c5cc35d3de0d6f4.json @@ -0,0 +1 @@ +{"uid":"4c5cc35d3de0d6f4","name":"Should return 'I smell a series!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_series","historyId":"fd37424f9957f0d1afe768cce5a8cc08","time":{"start":1732764221298,"stop":1732764221298,"duration":0},"description":"\n if there are more than 2 return\n 'I smell a series!'.\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1732764219268,"stop":1732764219268,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solve' function with various test data\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1732764219269,"stop":1732764219269,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":13,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1732764219272,"stop":1732764219272,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Casino chips"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"23151e1dbdaacb09","status":"passed","time":{"start":1732428194587,"stop":1732428194587,"duration":0}},{"uid":"c61d34eb10bf204","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}},{"uid":"7ec3425d5267a222","status":"passed","time":{"start":1724733473093,"stop":1724733473093,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"d19efceb39f40f4f","status":"passed","time":{"start":1732428194587,"stop":1732428194587,"duration":0}},{"uid":"41efd0d786aed73","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}},{"uid":"d1585e7c78fd8d06","status":"passed","time":{"start":1724735127984,"stop":1724735127984,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"4d4729a99109106e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/4d57a8ddade5816.json b/allure-report/data/test-cases/4d57a8ddade5816.json new file mode 100644 index 00000000000..26a94854ca6 --- /dev/null +++ b/allure-report/data/test-cases/4d57a8ddade5816.json @@ -0,0 +1 @@ +{"uid":"4d57a8ddade5816","name":"Testing anagrams function","fullName":"kyu_5.where_my_anagrams_at.test_anagrams.AnagramsTestCase#test_anagrams","historyId":"c060fb3e36725c887b4b4edce83f7142","time":{"start":1724735127938,"stop":1724735127938,"duration":0},"description":"\n Test a function that will find all the anagrams of a word from a list.\n You will be given two inputs a word and an array with words. You should\n return an array of all the anagrams or an empty array if there are none.\n\n For example:\n\n anagrams('abba', ['aabb', 'abcd', 'bbaa', 'dada']) => ['aabb', 'bbaa']\n anagrams('racer', ['crazer', 'carer', 'racar', 'caers', 'racer']) => ['carer', 'racer']\n anagrams('laser', ['lazing', 'lazy', 'lacer']) => []\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1732764218860,"stop":1732764218860,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function dir_reduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['NORTH', 'SOUTH', 'SOUTH', 'EAST', 'WEST', 'NORTH', 'WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1732764218861,"stop":1732764218861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1732764218861,"stop":1732764218861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'EAST', 'NORTH', 'EAST', 'WEST', 'WEST', 'EAST', 'EAST', 'WEST', 'SOUTH']) and verify the output (['NORTH', 'EAST']) vs expected (['NORTH', 'EAST'])","time":{"start":1732764218861,"stop":1732764218861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['EAST', 'NORTH', 'SOUTH', 'NORTH', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'NORTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'SOUTH', 'NORTH', 'NORTH', 'SOUTH', 'WEST', 'NORTH', 'EAST', 'WEST', 'WEST', 'WEST', 'EAST', 'SOUTH', 'SOUTH']) and verify the output (['EAST', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'WEST', 'NORTH', 'WEST', 'SOUTH', 'SOUTH']) vs expected (['EAST', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'WEST', 'NORTH', 'WEST', 'SOUTH', 'SOUTH'])","time":{"start":1732764218861,"stop":1732764218861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['WEST', 'NORTH', 'EAST', 'EAST', 'EAST', 'EAST', 'WEST', 'WEST', 'WEST', 'WEST', 'NORTH', 'NORTH', 'SOUTH', 'EAST']) and verify the output (['WEST', 'NORTH', 'NORTH', 'EAST']) vs expected (['WEST', 'NORTH', 'NORTH', 'EAST'])","time":{"start":1732764218861,"stop":1732764218861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1732764218862,"stop":1732764218862,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"aa8525de66192fb3","status":"passed","time":{"start":1732428194207,"stop":1732428194207,"duration":0}},{"uid":"a07fccce3e37ee4a","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"f7f7ddd6c717f082","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"5ea5418b10cdf416","status":"passed","time":{"start":1732428194207,"stop":1732428194207,"duration":0}},{"uid":"5e6aa533c6c0fafa","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"d65c16a1b47d468e","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"4eb91d777aea105a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dc1f8d6367d3e66e.json b/allure-report/data/test-cases/4f20da98ae3e1985.json similarity index 75% rename from allure-report/data/test-cases/dc1f8d6367d3e66e.json rename to allure-report/data/test-cases/4f20da98ae3e1985.json index ffbdcbd5df7..f477ba8bbbf 100644 --- a/allure-report/data/test-cases/dc1f8d6367d3e66e.json +++ b/allure-report/data/test-cases/4f20da98ae3e1985.json @@ -1 +1 @@ -{"uid":"dc1f8d6367d3e66e","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1724733472624,"stop":1724733472765,"duration":141},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472624,"stop":1724733472749,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8b32e9e6b9d5730c","name":"stdout","source":"8b32e9e6b9d5730c.txt","type":"text/plain","size":46002}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"dc1f8d6367d3e66e.json","parameterValues":[]} \ No newline at end of file +{"uid":"4f20da98ae3e1985","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1724733472624,"stop":1724733472765,"duration":141},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733472624,"stop":1724733472749,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d03a9a8c81cbe39f","name":"stdout","source":"d03a9a8c81cbe39f.txt","type":"text/plain","size":46002}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"4f20da98ae3e1985.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9326ca5c3b3bcaf3.json b/allure-report/data/test-cases/4f2bbc07480f42a4.json similarity index 76% rename from allure-report/data/test-cases/9326ca5c3b3bcaf3.json rename to allure-report/data/test-cases/4f2bbc07480f42a4.json index e5aa2b29198..373efda6715 100644 --- a/allure-report/data/test-cases/9326ca5c3b3bcaf3.json +++ b/allure-report/data/test-cases/4f2bbc07480f42a4.json @@ -1 +1 @@ -{"uid":"9326ca5c3b3bcaf3","name":"Testing 'factorial' function","fullName":"kyu_7.factorial.test_factorial.FactorialTestCase#test_factorial","historyId":"9f3faef7cd6efbe5a04de4e9c02ed5e1","time":{"start":1724733474241,"stop":1724733474241,"duration":0},"description":"\n Testing 'factorial' function\n\n In mathematics, the factorial of a non-negative integer n,\n denoted by n!, is the product of all positive integers less\n than or equal to n. For example: 5! = 5 * 4 * 3 * 2 * 1 = 120.\n By convention the value of 0! is 1.\n\n Write a function to calculate factorial for a given input.\n If input is below 0 or above 12 throw an exception of type\n ValueError (Python).\n :return:\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f509afa4d498e7c1","name":"stdout","source":"f509afa4d498e7c1.txt","type":"text/plain","size":1904}],"parameters":[],"hasContent":true,"stepsCount":21,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"2 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"5961f436380e11d2.json","parameterValues":[]} \ No newline at end of file +{"uid":"500f182a6eedd000","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1724735127122,"stop":1724735127141,"duration":19},"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724735127122,"stop":1724735127122,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fbbce307fc80ae94","name":"stdout","source":"fbbce307fc80ae94.txt","type":"text/plain","size":1904}],"parameters":[],"stepsCount":21,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724735127141,"stop":1724735127141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"2 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"500f182a6eedd000.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/533bf937be1aa466.json b/allure-report/data/test-cases/50b7ff1fe714521a.json similarity index 63% rename from allure-report/data/test-cases/533bf937be1aa466.json rename to allure-report/data/test-cases/50b7ff1fe714521a.json index 8a8b4976261..36a53cdb8b8 100644 --- a/allure-report/data/test-cases/533bf937be1aa466.json +++ b/allure-report/data/test-cases/50b7ff1fe714521a.json @@ -1 +1 @@ -{"uid":"533bf937be1aa466","name":"Testing flatten function","fullName":"kyu_5.flatten.test_flatten.FlattenTestCase#test_flatten","historyId":"bf9ab588ec37b96b09a8d0c56f74fc4a","time":{"start":1732428194277,"stop":1732428194277,"duration":0},"description":"\n For this exercise you will create a global flatten method.\n The method takes in any number of arguments and flattens\n them into a single array. If any of the arguments passed in\n are an array then the individual objects within the array\n will be flattened so that they exist at the same level as\n the other arguments. Any nested arrays, no matter how deep,\n should be flattened into the single array result.\n\n The following are examples of how this function would be\n used and what the expected results would be:\n\n flatten(1, [2, 3], 4, 5, [6, [7]]) # returns [1, 2, 3, 4, 5, 6, 7]\n flatten('a', ['b', 2], 3, None, [[4], ['c']]) # returns\n ['a', 'b', 2, 3, None, 4, 'c']\n :return:\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1732428193949,"stop":1732428193949,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1732428193951,"stop":1732428193951,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CIPHERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"SECURITY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"532d8f53f92733e9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3c944fe792fcd179.json b/allure-report/data/test-cases/5364b62b05552f1e.json similarity index 94% rename from allure-report/data/test-cases/3c944fe792fcd179.json rename to allure-report/data/test-cases/5364b62b05552f1e.json index f968a4a711a..f1af8ba3c38 100644 --- a/allure-report/data/test-cases/3c944fe792fcd179.json +++ b/allure-report/data/test-cases/5364b62b05552f1e.json @@ -1 +1 @@ -{"uid":"3c944fe792fcd179","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"Lists"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"3c944fe792fcd179.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"5364b62b05552f1e","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"Lists"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"5364b62b05552f1e.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/9348c64cc78f5d13.json b/allure-report/data/test-cases/5392fbee850dfcf4.json
similarity index 72%
rename from allure-report/data/test-cases/9348c64cc78f5d13.json
rename to allure-report/data/test-cases/5392fbee850dfcf4.json
index 5465d764c58..1a7dad70c0d 100644
--- a/allure-report/data/test-cases/9348c64cc78f5d13.json
+++ b/allure-report/data/test-cases/5392fbee850dfcf4.json
@@ -1 +1 @@
-{"uid":"9348c64cc78f5d13","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9b1bb88dc50af4ea","name":"stdout","source":"9b1bb88dc50af4ea.txt","type":"text/plain","size":428}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Factorial"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"9348c64cc78f5d13.json","parameterValues":[]} \ No newline at end of file +{"uid":"5392fbee850dfcf4","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"bcefb385384ff8bd","name":"stdout","source":"bcefb385384ff8bd.txt","type":"text/plain","size":428}],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Factorial"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"5392fbee850dfcf4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/53eb34bc4e02fa07.json b/allure-report/data/test-cases/53eb34bc4e02fa07.json new file mode 100644 index 00000000000..a03f4df9029 --- /dev/null +++ b/allure-report/data/test-cases/53eb34bc4e02fa07.json @@ -0,0 +1 @@ +{"uid":"53eb34bc4e02fa07","name":"Testing easy_diagonal function","fullName":"kyu_6.easy_diagonal.test_diagonal.EasyDiagonalTestCase#test_easy_diagonal","historyId":"5d9c9166bf610b28a284723b5b23aab1","time":{"start":1732764219387,"stop":1732764220132,"duration":745},"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1732764219386,"stop":1732764219386,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1732764219387,"stop":1732764219387,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1732764219387,"stop":1732764219387,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1732764219387,"stop":1732764219387,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1732764219387,"stop":1732764219387,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1732764219387,"stop":1732764219387,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1732764219387,"stop":1732764219387,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1732764219387,"stop":1732764219387,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1732764219387,"stop":1732764219387,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1732764220132,"stop":1732764220132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1732764220144,"stop":1732764220144,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Diagonal"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"711b3df283530a5b","status":"passed","time":{"start":1732428194708,"stop":1732428195425,"duration":717}},{"uid":"8d85f39401914c16","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}},{"uid":"abf4f2031d384e78","status":"passed","time":{"start":1724733473218,"stop":1724733473889,"duration":671}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"56da494ae1701253","status":"passed","time":{"start":1732428194708,"stop":1732428195425,"duration":717}},{"uid":"964ad50f448ed64d","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}},{"uid":"7f2ec06c200d3086","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"53eb34bc4e02fa07.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9e6f93dfe778ff9a.json b/allure-report/data/test-cases/53fa8d477eb42fd3.json similarity index 69% rename from allure-report/data/test-cases/9e6f93dfe778ff9a.json rename to allure-report/data/test-cases/53fa8d477eb42fd3.json index 0e340495bd1..a99cd958d79 100644 --- a/allure-report/data/test-cases/9e6f93dfe778ff9a.json +++ b/allure-report/data/test-cases/53fa8d477eb42fd3.json @@ -1 +1 @@ -{"uid":"9e6f93dfe778ff9a","name":"Testing litres function with various test inputs","fullName":"kyu_8.keep_hydrated.test_keep_hydrated.KeepHydratedTestCase#test_keep_hydrated","historyId":"d2c9cdacf9fca346eec2858cd44275e6","time":{"start":1724733474788,"stop":1724733474788,"duration":0},"description":"\n Testing litres function with various test inputs\n :return:\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6f4b7e883a26cafe","name":"stdout","source":"6f4b7e883a26cafe.txt","type":"text/plain","size":878}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"CIPHERS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"54e4671ce8499dcf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/54fbe05c675f404a.json b/allure-report/data/test-cases/54fbe05c675f404a.json new file mode 100644 index 00000000000..56c91c6b996 --- /dev/null +++ b/allure-report/data/test-cases/54fbe05c675f404a.json @@ -0,0 +1 @@ +{"uid":"54fbe05c675f404a","name":"String with alphabet chars only","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_alpha_only","historyId":"f1e3ad74179a106b1d5dc35a6ffe21fa","time":{"start":1732764220163,"stop":1732764220164,"duration":1},"description":"\n Test string with alphabet chars only.\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"efae8b9f43d09441","name":"stdout","source":"efae8b9f43d09441.txt","type":"text/plain","size":640}],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Casino chips"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"552742d77daecee9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ddd928ac3a4fb635.json b/allure-report/data/test-cases/552b72a0721ea486.json similarity index 74% rename from allure-report/data/test-cases/ddd928ac3a4fb635.json rename to allure-report/data/test-cases/552b72a0721ea486.json index b88c1a5f05b..5c82b4cef7f 100644 --- a/allure-report/data/test-cases/ddd928ac3a4fb635.json +++ b/allure-report/data/test-cases/552b72a0721ea486.json @@ -1 +1 @@ -{"uid":"ddd928ac3a4fb635","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"ddd928ac3a4fb635.json","parameterValues":[]} \ No newline at end of file +{"uid":"552b72a0721ea486","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"552b72a0721ea486.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3b395c1683e127a4.json b/allure-report/data/test-cases/555a795f08de5e6c.json similarity index 58% rename from allure-report/data/test-cases/3b395c1683e127a4.json rename to allure-report/data/test-cases/555a795f08de5e6c.json index 6cd2fbfff54..f81cc08775a 100644 --- a/allure-report/data/test-cases/3b395c1683e127a4.json +++ b/allure-report/data/test-cases/555a795f08de5e6c.json @@ -1 +1 @@ -{"uid":"3b395c1683e127a4","name":"a and b are equal","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_equal_numbers","historyId":"2972663ca9fa4b4f0e6ea69060a464d5","time":{"start":1732428195740,"stop":1732428195740,"duration":0},"description":"\n a and b are equal\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428194238,"stop":1732428194238,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5b153d545c48d264","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"a530698ca5ed066c","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"614b9e2de4457676","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"e798d2f5cc38e024","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"2b76b55d8c8f82d1.json","parameterValues":[]} \ No newline at end of file +{"uid":"574cb5d6827dca2a","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1732428194237,"stop":1732428194238,"duration":1},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428194238,"stop":1732428194238,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"574cb5d6827dca2a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/577d9e765fb39849.json b/allure-report/data/test-cases/577d9e765fb39849.json new file mode 100644 index 00000000000..40fa41e144e --- /dev/null +++ b/allure-report/data/test-cases/577d9e765fb39849.json @@ -0,0 +1 @@ +{"uid":"577d9e765fb39849","name":"test_line_negative","fullName":"kyu_3.line_safari_is_that_a_line.test_line_negative.LineNegativeTestCase#test_line_negative","historyId":"e5c7abe0fcf3b79049d906f50808feb6","time":{"start":1732764218558,"stop":1732764218558,"duration":0},"description":"\n Testing Line Safari functionality\n Negative test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 37, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"63ceea7fe946ff07","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428193914,"stop":1732428193914,"duration":0}},{"uid":"f10852a0a46489bf","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"96ce14353b4f3e49","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"996ab105867adbc9","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428193914,"stop":1732428193914,"duration":0}},{"uid":"88c7e92ae3f035ea","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"620b2589fb870406","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"577d9e765fb39849.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/51e0b16785f0d461.json b/allure-report/data/test-cases/579e5f45553c02f2.json
similarity index 81%
rename from allure-report/data/test-cases/51e0b16785f0d461.json
rename to allure-report/data/test-cases/579e5f45553c02f2.json
index 9ba55e16d29..87a6f6e223d 100644
--- a/allure-report/data/test-cases/51e0b16785f0d461.json
+++ b/allure-report/data/test-cases/579e5f45553c02f2.json
@@ -1 +1 @@
-{"uid":"51e0b16785f0d461","name":"Testing 'feast' function","fullName":"kyu_8.the_feast_of_many_beasts.test_feast.FeastTestCase#test_feast","historyId":"963bc543b4e4096b877e161985d8949c","time":{"start":1724735129695,"stop":1724735129695,"duration":0},"description":"\n Testing 'feast' function with various test inputs\n\n Testing a function feast that takes the animal's\n name and dish as arguments and returns true or\n false to indicate whether the beast is allowed\n to bring the dish to the feast.\n\n Assume that beast and dish are always lowercase strings,\n and that each has at least two letters. beast and dish\n may contain hyphens and spaces, but these will not appear\n at the beginning or end of the string. They will not\n contain numerals.\n\n There is just one rule: the dish must start and end with\n the same letters as the animal's name. For example, the\n great blue heron is bringing garlic naan and the chickadee\n is bringing chocolate cake.\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an un-existing item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6ec9f0fb81f46c5f","name":"stdout","source":"6ec9f0fb81f46c5f.txt","type":"text/plain","size":378}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"45f16c4708137d2d.json","parameterValues":[]} \ No newline at end of file +{"uid":"582aa68275dac68e","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an un-existing item and verify the result","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"57a50be8b38a35c0","name":"stdout","source":"57a50be8b38a35c0.txt","type":"text/plain","size":378}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"582aa68275dac68e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/302b8c55161cc361.json b/allure-report/data/test-cases/583a0190aa99ad42.json similarity index 66% rename from allure-report/data/test-cases/302b8c55161cc361.json rename to allure-report/data/test-cases/583a0190aa99ad42.json index 58843d0f2e4..b20149bdd5d 100644 --- a/allure-report/data/test-cases/302b8c55161cc361.json +++ b/allure-report/data/test-cases/583a0190aa99ad42.json @@ -1 +1 @@ -{"uid":"302b8c55161cc361","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e2e513778c4c6c4f","name":"stdout","source":"e2e513778c4c6c4f.txt","type":"text/plain","size":213}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"ARITHMETIC"},{"name":"story","value":"Sum of odd numbers"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","LISTS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"302b8c55161cc361.json","parameterValues":[]} \ No newline at end of file +{"uid":"583a0190aa99ad42","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a85d028b53b2fa36","name":"stdout","source":"a85d028b53b2fa36.txt","type":"text/plain","size":213}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724735129274,"stop":1724735129274,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"ARITHMETIC"},{"name":"story","value":"Sum of odd numbers"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","LISTS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"583a0190aa99ad42.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/68ae9688c7c99a04.json b/allure-report/data/test-cases/584f8bdd5c7f3c16.json similarity index 65% rename from allure-report/data/test-cases/68ae9688c7c99a04.json rename to allure-report/data/test-cases/584f8bdd5c7f3c16.json index d2c88d9c39d..7a60f1cb6c6 100644 --- a/allure-report/data/test-cases/68ae9688c7c99a04.json +++ b/allure-report/data/test-cases/584f8bdd5c7f3c16.json @@ -1 +1 @@ -{"uid":"68ae9688c7c99a04","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4c19c67f026536b3","name":"stdout","source":"4c19c67f026536b3.txt","type":"text/plain","size":882}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"68ae9688c7c99a04.json","parameterValues":[]} \ No newline at end of file +{"uid":"584f8bdd5c7f3c16","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2e61a28436ed8397","name":"stdout","source":"2e61a28436ed8397.txt","type":"text/plain","size":882}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724733472421,"stop":1724733472421,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"584f8bdd5c7f3c16.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bce82edab468d2f2.json b/allure-report/data/test-cases/58a164b572fc5a50.json similarity index 63% rename from allure-report/data/test-cases/bce82edab468d2f2.json rename to allure-report/data/test-cases/58a164b572fc5a50.json index c8b29ec7301..bda7024a4b1 100644 --- a/allure-report/data/test-cases/bce82edab468d2f2.json +++ b/allure-report/data/test-cases/58a164b572fc5a50.json @@ -1 +1 @@ -{"uid":"bce82edab468d2f2","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"282ef4a825ddd5b7","name":"stdout","source":"282ef4a825ddd5b7.txt","type":"text/plain","size":530}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"bce82edab468d2f2.json","parameterValues":[]} \ No newline at end of file +{"uid":"58a164b572fc5a50","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"998c70b07f1415e5","name":"stdout","source":"998c70b07f1415e5.txt","type":"text/plain","size":530}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"58a164b572fc5a50.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1bf2db2d5f0c7414.json b/allure-report/data/test-cases/58bbccd3c8af3c06.json similarity index 52% rename from allure-report/data/test-cases/1bf2db2d5f0c7414.json rename to allure-report/data/test-cases/58bbccd3c8af3c06.json index 9c52f5d2a1e..a3e0a12ba24 100644 --- a/allure-report/data/test-cases/1bf2db2d5f0c7414.json +++ b/allure-report/data/test-cases/58bbccd3c8af3c06.json @@ -1 +1 @@ -{"uid":"1bf2db2d5f0c7414","name":"powers function should return an array of unique numbers","fullName":"kyu_7.sum_of_powers_of_2.test_sum_of_powers_of_2.SumOfPowerOfTwoTestCase#test_powers","historyId":"489e3070dc83756c411301400dd6e3c8","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"description":"\n The function powers takes a single parameter,\n the number n, and should return an array of unique numbers.\n :return:\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1732428193958,"stop":1732428193958,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1732428193961,"stop":1732428193961,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CIPHERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"SECURITY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"97ad1cd914697b30","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"54e4671ce8499dcf","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"8a76fd0002a5824c","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"3fa15071b1bee987","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"9dd5714486b51753.json","parameterValues":[]} \ No newline at end of file +{"uid":"5b904804aa9a6e53","name":"Testing Encoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding.EncodingTestCase#test_encoding","historyId":"195b2d3cd638502ec301b9e9eaa3f969","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1732428193958,"stop":1732428193958,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193959,"stop":1732428193959,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1732428193961,"stop":1732428193961,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CIPHERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"SECURITY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"5b904804aa9a6e53.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6e3ab906ce5621b5.json b/allure-report/data/test-cases/5bc730ff95f1c205.json similarity index 59% rename from allure-report/data/test-cases/6e3ab906ce5621b5.json rename to allure-report/data/test-cases/5bc730ff95f1c205.json index d81114718c0..23e4e086742 100644 --- a/allure-report/data/test-cases/6e3ab906ce5621b5.json +++ b/allure-report/data/test-cases/5bc730ff95f1c205.json @@ -1 +1 @@ -{"uid":"6e3ab906ce5621b5","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1732428194529,"stop":1732428194529,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7362d176d35d3813","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}},{"uid":"9abe86e868e9efe6","status":"passed","time":{"start":1724733473030,"stop":1724733473030,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"6cad203fab564c60","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}},{"uid":"63cbfe00daba1c69","status":"passed","time":{"start":1724735127922,"stop":1724735127922,"duration":0}}]},"tags":["ARRAY","ALGORITHMS"]},"source":"6e3ab906ce5621b5.json","parameterValues":[]} \ No newline at end of file +{"uid":"5bc730ff95f1c205","name":"Testing done_or_not function","fullName":"kyu_5.tic_tac_toe_checker.test_checker.IsSolvedTestCase#test_is_solved","historyId":"059761e477dad0853fa6e0ed172a78f0","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing is_solved function\n\n The function should return whether the\n board's current state is solved.\n\n We want our function to return:\n\n -1 if the board is not yet finished (there are empty spots),\n 1 if \"X\" won,\n 2 if \"O\" won,\n 0 if it's a cat's game (i.e. a draw).\n ","descriptionHtml":"The function should return whether the board's current state is solved.
","status":"passed","steps":[{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter Tic-Tac-Toe board and verify the output.","time":{"start":1732428194528,"stop":1732428194528,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsSolvedTestCase::0","time":{"start":1732428194529,"stop":1732428194529,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAY"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Tic-Tac-Toe Checker"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.tic_tac_toe_checker.test_checker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/525caa5c1bf619d28c000335","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ARRAY","ALGORITHMS"]},"source":"5bc730ff95f1c205.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5a2ae93193e5280a.json b/allure-report/data/test-cases/5bf0909978db7e30.json similarity index 55% rename from allure-report/data/test-cases/5a2ae93193e5280a.json rename to allure-report/data/test-cases/5bf0909978db7e30.json index 0f97a9f49e4..6d9fa17f585 100644 --- a/allure-report/data/test-cases/5a2ae93193e5280a.json +++ b/allure-report/data/test-cases/5bf0909978db7e30.json @@ -1 +1 @@ -{"uid":"5a2ae93193e5280a","name":"Testing litres function with various test inputs","fullName":"kyu_8.keep_hydrated.test_keep_hydrated.KeepHydratedTestCase#test_keep_hydrated","historyId":"d2c9cdacf9fca346eec2858cd44275e6","time":{"start":1732428196278,"stop":1732428196278,"duration":0},"description":"\n Testing litres function with various test inputs\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8a1d25baaaa2cac0","name":"stdout","source":"8a1d25baaaa2cac0.txt","type":"text/plain","size":611}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"73db1f36a5925004.json","parameterValues":[]} \ No newline at end of file +{"uid":"5c657b72ebb12427","name":"'fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8bb1795fd7e9c165","name":"stdout","source":"8bb1795fd7e9c165.txt","type":"text/plain","size":611}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724735129617,"stop":1724735129617,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"5c657b72ebb12427.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6ca78efd90ffa643.json b/allure-report/data/test-cases/5cbf19148d05755c.json similarity index 58% rename from allure-report/data/test-cases/6ca78efd90ffa643.json rename to allure-report/data/test-cases/5cbf19148d05755c.json index 2941398742f..d4400e246d0 100644 --- a/allure-report/data/test-cases/6ca78efd90ffa643.json +++ b/allure-report/data/test-cases/5cbf19148d05755c.json @@ -1 +1 @@ -{"uid":"6ca78efd90ffa643","name":"Testing remove_char function","fullName":"kyu_8.remove_first_and_last_character.test_remove_char.RemoveCharTestCase#test_remove_char","historyId":"094915dd36d829c22ed2375a32962ac5","time":{"start":1732428196345,"stop":1732428196345,"duration":0},"description":"\n Test that 'remove_char' function\n removes the first and\n last characters of a string.\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1732764218633,"stop":1732764218633,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1732764218634,"stop":1732764218634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"eac7f340d73193c2","status":"passed","time":{"start":1732428193982,"stop":1732428193982,"duration":0}},{"uid":"8dcdfa9166c48fb8","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}},{"uid":"ab7f75990cdffa76","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"3e8741eae0b44214","status":"passed","time":{"start":1732428193982,"stop":1732428193982,"duration":0}},{"uid":"7b2352a8e3675c67","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}},{"uid":"db7b4c897ddcf1a6","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"5e2354482de170d3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5e4416fd32f6992f.json b/allure-report/data/test-cases/5e4416fd32f6992f.json new file mode 100644 index 00000000000..cbb9574a430 --- /dev/null +++ b/allure-report/data/test-cases/5e4416fd32f6992f.json @@ -0,0 +1 @@ +{"uid":"5e4416fd32f6992f","name":"Testing Encoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding.EncodingTestCase#test_encoding","historyId":"195b2d3cd638502ec301b9e9eaa3f969","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1732764218599,"stop":1732764218599,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218600,"stop":1732764218600,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1732764218604,"stop":1732764218604,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"SECURITY"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CIPHERS"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5b904804aa9a6e53","status":"passed","time":{"start":1732428193959,"stop":1732428193959,"duration":0}},{"uid":"c91f2e2d1c4e5a72","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"2483ff464fe4ea07","status":"passed","time":{"start":1724733472358,"stop":1724733472358,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"9dd5714486b51753","status":"passed","time":{"start":1732428193959,"stop":1732428193959,"duration":0}},{"uid":"8a76fd0002a5824c","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"3fa15071b1bee987","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"5e4416fd32f6992f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/47cc31f6ebf12c13.json b/allure-report/data/test-cases/5e8bbbba63c3bb75.json similarity index 58% rename from allure-report/data/test-cases/47cc31f6ebf12c13.json rename to allure-report/data/test-cases/5e8bbbba63c3bb75.json index f35334246f0..97918d8092f 100644 --- a/allure-report/data/test-cases/47cc31f6ebf12c13.json +++ b/allure-report/data/test-cases/5e8bbbba63c3bb75.json @@ -1 +1 @@ -{"uid":"47cc31f6ebf12c13","name":"Testing toJadenCase function (negative)","fullName":"kyu_7.jaden_casing_strings.test_jaden_casing_strings.JadenCasingStringsTestCase#test_to_jaden_case_negative","historyId":"3a2cad5dab684132d1f8974f9a6b5c75","time":{"start":1732428195869,"stop":1732428195869,"duration":0},"description":"\n Simple negative test\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ca0d330469f49836","name":"stdout","source":"ca0d330469f49836.txt","type":"text/plain","size":640}],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"6030df3a53146090.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6035f0fe38b5a062.json b/allure-report/data/test-cases/6035f0fe38b5a062.json new file mode 100644 index 00000000000..c7f82ca4183 --- /dev/null +++ b/allure-report/data/test-cases/6035f0fe38b5a062.json @@ -0,0 +1 @@ +{"uid":"6035f0fe38b5a062","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1732764218796,"stop":1732764218796,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1732764218790,"stop":1732764218790,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1732764218796,"stop":1732764218796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1732764218796,"stop":1732764218796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1732764218796,"stop":1732764218796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1732764218796,"stop":1732764218796,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1732764218797,"stop":1732764218797,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"OOP"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"epic","value":"4 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f520dc2a3cdded7a","status":"passed","time":{"start":1732428194145,"stop":1732428194146,"duration":1}},{"uid":"3bb063d5045f38b5","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}},{"uid":"ba3e30be8784f086","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"1700dd3f253e8636","status":"passed","time":{"start":1732428194145,"stop":1732428194146,"duration":1}},{"uid":"675849fee1009391","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}},{"uid":"c1f2317d20109e13","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"6035f0fe38b5a062.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/60d4140245a65d5.json b/allure-report/data/test-cases/60d4140245a65d5.json new file mode 100644 index 00000000000..dcd997305d0 --- /dev/null +++ b/allure-report/data/test-cases/60d4140245a65d5.json @@ -0,0 +1 @@ +{"uid":"60d4140245a65d5","name":"String with mixed type of chars","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_dup_mixed","historyId":"befc81f16d3ea9a4d57ecd3fed78faff","time":{"start":1732764220167,"stop":1732764220168,"duration":1},"description":"\n Test string with mixed type of chars.\n :return:\n ","descriptionHtml":"Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"dd695e9095070885","name":"stdout","source":"dd695e9095070885.txt","type":"text/plain","size":3898}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAME BOARDS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"56ae9013352b7649.json","parameterValues":[]} \ No newline at end of file +{"uid":"616388e3d3f3ad4c","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d8a2a5280a09e0f4","name":"stdout","source":"d8a2a5280a09e0f4.txt","type":"text/plain","size":3898}],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAME BOARDS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"616388e3d3f3ad4c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7da87d8449dbfb8b.json b/allure-report/data/test-cases/61de742601660eab.json similarity index 65% rename from allure-report/data/test-cases/7da87d8449dbfb8b.json rename to allure-report/data/test-cases/61de742601660eab.json index 3013b3daa23..b9b9a43ef7b 100644 --- a/allure-report/data/test-cases/7da87d8449dbfb8b.json +++ b/allure-report/data/test-cases/61de742601660eab.json @@ -1 +1 @@ -{"uid":"7da87d8449dbfb8b","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724735127688,"stop":1724735127813,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127703,"duration":15},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127703,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127735,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127735,"stop":1724735127781,"duration":46},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1724735127781,"stop":1724735127813,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d8f05623e6466063","name":"stdout","source":"d8f05623e6466063.txt","type":"text/plain","size":932}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724735127813,"stop":1724735127813,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Integers: Recreation One"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"OPTIMIZATION"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"7da87d8449dbfb8b.json","parameterValues":[]} \ No newline at end of file +{"uid":"61de742601660eab","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1724735127688,"stop":1724735127813,"duration":125},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127688,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127688,"stop":1724735127703,"duration":15},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127703,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127703,"stop":1724735127735,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127735,"stop":1724735127781,"duration":46},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1724735127781,"stop":1724735127813,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a9137c6294090d64","name":"stdout","source":"a9137c6294090d64.txt","type":"text/plain","size":932}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1724735127813,"stop":1724735127813,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Integers: Recreation One"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"OPTIMIZATION"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"61de742601660eab.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/61e07c6ddcc506b1.json b/allure-report/data/test-cases/61e07c6ddcc506b1.json new file mode 100644 index 00000000000..ba89a2a9121 --- /dev/null +++ b/allure-report/data/test-cases/61e07c6ddcc506b1.json @@ -0,0 +1 @@ +{"uid":"61e07c6ddcc506b1","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1732764218771,"stop":1732764218772,"duration":1},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1732764218769,"stop":1732764218769,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1732764218771,"stop":1732764218771,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1732764218771,"stop":1732764218771,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1732764218771,"stop":1732764218771,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1732764218771,"stop":1732764218771,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1732764218771,"stop":1732764218771,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1732764218772,"stop":1732764218772,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1732764218772,"stop":1732764218772,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1732764218772,"stop":1732764218772,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1732764218772,"stop":1732764218772,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1732764218774,"stop":1732764218774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Aggregations"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"ARITHMETIC"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"84ea3c3b3250393e","status":"passed","time":{"start":1732428194124,"stop":1732428194125,"duration":1}},{"uid":"99a774ce5ee6bba3","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}},{"uid":"8c4c3ac3b9ddced3","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"9f9422c1f71252b6","status":"passed","time":{"start":1732428194124,"stop":1732428194125,"duration":1}},{"uid":"e03974f538ea8ee6","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}},{"uid":"acc95e26a53d92ff","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}}]},"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"61e07c6ddcc506b1.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/37f24af32c057862.json b/allure-report/data/test-cases/61f84f81177cf38b.json similarity index 92% rename from allure-report/data/test-cases/37f24af32c057862.json rename to allure-report/data/test-cases/61f84f81177cf38b.json index 79c37159f34..8d6b8743dda 100644 --- a/allure-report/data/test-cases/37f24af32c057862.json +++ b/allure-report/data/test-cases/61f84f81177cf38b.json @@ -1 +1 @@ -{"uid":"37f24af32c057862","name":"test_solution_empty","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_empty","historyId":"29249ea89f0081dda70899f3290f857b","time":{"start":1724733472577,"stop":1724733472577,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 86, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"37f24af32c057862.json","parameterValues":[]} \ No newline at end of file +{"uid":"61f84f81177cf38b","name":"test_solution_empty","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_empty","historyId":"29249ea89f0081dda70899f3290f857b","time":{"start":1724733472577,"stop":1724733472577,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 86, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"61f84f81177cf38b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b36380d1077ce20b.json b/allure-report/data/test-cases/6209b3d491320ab9.json similarity index 56% rename from allure-report/data/test-cases/b36380d1077ce20b.json rename to allure-report/data/test-cases/6209b3d491320ab9.json index 8edb958730e..e77432081d1 100644 --- a/allure-report/data/test-cases/b36380d1077ce20b.json +++ b/allure-report/data/test-cases/6209b3d491320ab9.json @@ -1 +1 @@ -{"uid":"b36380d1077ce20b","name":"'multiply' function verification: lists with multiple digits","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest","historyId":"6105a97f729c5e36b325cf44492db688","time":{"start":1732428195921,"stop":1732428195921,"duration":0},"description":"\n Test lists with multiple digits\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a3216b951d3fac8b.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"624b364c1e1f6bc7","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"624b364c1e1f6bc7.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/e8ed1f5e4a826f53.json b/allure-report/data/test-cases/625a87864855843c.json
similarity index 65%
rename from allure-report/data/test-cases/e8ed1f5e4a826f53.json
rename to allure-report/data/test-cases/625a87864855843c.json
index c59f8bbdd95..bd8c081c7a9 100644
--- a/allure-report/data/test-cases/e8ed1f5e4a826f53.json
+++ b/allure-report/data/test-cases/625a87864855843c.json
@@ -1 +1 @@
-{"uid":"e8ed1f5e4a826f53","name":"move function tests","fullName":"kyu_8.terminal_game_move_function.test_terminal_game_move_function.MoveTestCase#test_move","historyId":"c589035c90d432fb71a99aec4f56ee9e","time":{"start":1724733474929,"stop":1724733474929,"duration":0},"description":"\n The player rolls the dice and moves the number\n of spaces indicated by the dice two times.\n\n Pass position and roll and compare the output\n to the expected result\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'thirt' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1732764219232,"stop":1732764219232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1216cba41972f97c","status":"passed","time":{"start":1732428194550,"stop":1732428194550,"duration":0}},{"uid":"1a8f12ae9a258bd1","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"24b32ad032525022","status":"passed","time":{"start":1724733473046,"stop":1724733473061,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"777edc280c74020d","status":"passed","time":{"start":1732428194550,"stop":1732428194550,"duration":0}},{"uid":"585949d19b46a5d2","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}},{"uid":"66f1b8d1e5ed1dbe","status":"passed","time":{"start":1724735127953,"stop":1724735127953,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"62a6bbd8d87be20e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/62ef482e2cb3493b.json b/allure-report/data/test-cases/62ef482e2cb3493b.json deleted file mode 100644 index e1a62398e77..00000000000 --- a/allure-report/data/test-cases/62ef482e2cb3493b.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"62ef482e2cb3493b","name":"Positive test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_positive","historyId":"fb8836e996664af9461454bae0b6f79c","time":{"start":1732428196489,"stop":1732428196489,"duration":0},"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1732428196489,"stop":1732428196489,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1732428196491,"stop":1732428196491,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"3cb4765f4f4fe8e7","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"cc1bd3cedb1bfef0","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"1b3bd0a5ea1aa072","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"2030ea00b6998f67","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"62ef482e2cb3493b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/631ed8ca3aead56c.json b/allure-report/data/test-cases/631ed8ca3aead56c.json new file mode 100644 index 00000000000..5ac59c1136a --- /dev/null +++ b/allure-report/data/test-cases/631ed8ca3aead56c.json @@ -0,0 +1 @@ +{"uid":"631ed8ca3aead56c","name":"powers function should return an array of unique numbers","fullName":"kyu_7.sum_of_powers_of_2.test_sum_of_powers_of_2.SumOfPowerOfTwoTestCase#test_powers","historyId":"489e3070dc83756c411301400dd6e3c8","time":{"start":1732764220715,"stop":1732764220719,"duration":4},"description":"\n The function powers takes a single parameter,\n the number n, and should return an array of\n unique numbers.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ad44f1f08939323f","name":"stdout","source":"ad44f1f08939323f.txt","type":"text/plain","size":371}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"12ac45051c49f01a.json","parameterValues":[]} \ No newline at end of file +{"uid":"632eacb89b6e193e","name":"Testing 'DefaultList' class: __getitem__","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_basic","historyId":"7dba0545991d74ec4981bfb3eea48559","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence types,\n the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"96a11dda30514e67","name":"stdout","source":"96a11dda30514e67.txt","type":"text/plain","size":371}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"632eacb89b6e193e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2f520e29faf9fa03.json b/allure-report/data/test-cases/634b88b34b81a74c.json similarity index 92% rename from allure-report/data/test-cases/2f520e29faf9fa03.json rename to allure-report/data/test-cases/634b88b34b81a74c.json index 6f2faf92c07..5289e5596cf 100644 --- a/allure-report/data/test-cases/2f520e29faf9fa03.json +++ b/allure-report/data/test-cases/634b88b34b81a74c.json @@ -1 +1 @@ -{"uid":"2f520e29faf9fa03","name":"test_solution_medium","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_medium","historyId":"7ee6731933bd9dff6fabc41830db1bf0","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 32, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"2f520e29faf9fa03.json","parameterValues":[]} \ No newline at end of file +{"uid":"634b88b34b81a74c","name":"test_solution_medium","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_medium","historyId":"7ee6731933bd9dff6fabc41830db1bf0","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 32, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Diophantine Equation"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"634b88b34b81a74c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/63a8ebd07b8fa1c4.json b/allure-report/data/test-cases/63a8ebd07b8fa1c4.json new file mode 100644 index 00000000000..573091683bf --- /dev/null +++ b/allure-report/data/test-cases/63a8ebd07b8fa1c4.json @@ -0,0 +1 @@ +{"uid":"63a8ebd07b8fa1c4","name":"Testing 'has_subpattern' (part 3) function","fullName":"kyu_6.string_subpattern_recognition_3.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"89f53112353ba49dc8f3a4029d39ba34","time":{"start":1732764220337,"stop":1732764220337,"duration":0},"description":"\n Verify that 'has_subpattern' function\n\n Return a subpattern with sorted characters,\n otherwise return the base string with sorted\n characters (you might consider this case as\n an edge case, with the subpattern being repeated\n only once and thus equalling the original input string).\n :return:\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 37, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"445f2e59cb6a4191","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"8efea6185ce9f545","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"88c7e92ae3f035ea","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"620b2589fb870406","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"996ab105867adbc9.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"63ceea7fe946ff07","name":"test_line_negative","fullName":"kyu_3.line_safari_is_that_a_line.test_line_negative.LineNegativeTestCase#test_line_negative","historyId":"e5c7abe0fcf3b79049d906f50808feb6","time":{"start":1732428193914,"stop":1732428193914,"duration":0},"description":"\n Testing Line Safari functionality\n Negative test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 37, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"63ceea7fe946ff07.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/63ea9545d8dcd43f.json b/allure-report/data/test-cases/63ea9545d8dcd43f.json
new file mode 100644
index 00000000000..7c5e48cab91
--- /dev/null
+++ b/allure-report/data/test-cases/63ea9545d8dcd43f.json
@@ -0,0 +1 @@
+{"uid":"63ea9545d8dcd43f","name":"Wolf at the beginning of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_at_start","historyId":"dcabd02011959f0337d9098678ad990d","time":{"start":1732764221337,"stop":1732764221337,"duration":0},"description":"\n If the wolf is the closest animal to you,\n return \"Pls go away and stop eating my sheep\".\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1732428195509,"stop":1732428195510,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing stock_list function with various test data\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1732428195512,"stop":1732428195512,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"602b6b1c829f1e7f","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}},{"uid":"9ee9ff331756b11e","status":"passed","time":{"start":1724733473960,"stop":1724733473960,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"1719ddf6913445c8","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}},{"uid":"66511dda8143933e","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"9267ea7150c527ef.json","parameterValues":[]} \ No newline at end of file +{"uid":"64001087ec7aaf2b","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"description":"\n Testing stock_list function with various test data\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1732428195509,"stop":1732428195510,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing stock_list function with various test data\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1732428195510,"stop":1732428195510,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1732428195512,"stop":1732428195512,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"64001087ec7aaf2b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/641b1ee7248b1557.json b/allure-report/data/test-cases/641b1ee7248b1557.json new file mode 100644 index 00000000000..4b3f13daa06 --- /dev/null +++ b/allure-report/data/test-cases/641b1ee7248b1557.json @@ -0,0 +1 @@ +{"uid":"641b1ee7248b1557","name":"Testing next_smaller function","fullName":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller.NextSmallerTestCase#test_next_smaller","historyId":"9d8cb8adf1764c55348d349698b938ac","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1732764218641,"stop":1732764218641,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1732764218643,"stop":1732764218643,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a329da92784fccae","status":"passed","time":{"start":1732428193992,"stop":1732428193993,"duration":1}},{"uid":"ee182a5a1f4b39dc","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}},{"uid":"a53e477b227bdf44","status":"passed","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"5eca272b3b393557","status":"passed","time":{"start":1732428193992,"stop":1732428193993,"duration":1}},{"uid":"b01fd4e8d095b60f","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}},{"uid":"913459f449cde9ee","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}}]},"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"641b1ee7248b1557.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b080152571ac4adf.json b/allure-report/data/test-cases/641fd537e33a59ae.json similarity index 75% rename from allure-report/data/test-cases/b080152571ac4adf.json rename to allure-report/data/test-cases/641fd537e33a59ae.json index d45d46ff9eb..a3b5435c3da 100644 --- a/allure-report/data/test-cases/b080152571ac4adf.json +++ b/allure-report/data/test-cases/641fd537e33a59ae.json @@ -1 +1 @@ -{"uid":"b080152571ac4adf","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d85ac6726b459082","name":"stdout","source":"d85ac6726b459082.txt","type":"text/plain","size":562}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"b080152571ac4adf.json","parameterValues":[]} \ No newline at end of file +{"uid":"641fd537e33a59ae","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733472624,"stop":1724733472624,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9f9ce9c609c0bc6d","name":"stdout","source":"9f9ce9c609c0bc6d.txt","type":"text/plain","size":562}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724733472765,"stop":1724733472765,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Find the safest places in town"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"641fd537e33a59ae.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6421e8610575915.json b/allure-report/data/test-cases/6421e8610575915.json deleted file mode 100644 index de7b4b30cb7..00000000000 --- a/allure-report/data/test-cases/6421e8610575915.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"6421e8610575915","name":"Testing is_palindrome function","fullName":"kyu_8.is_it_a_palindrome.test_is_palindrome.IsPalindromeTestCase#test_is_palindrome","historyId":"4967a6ca0665c8eeeec85898f8bda8f5","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"description":"\n Testing is_palindrome function\n with various test inputs\n\n The function should check if a\n given string (case insensitive)\n is a palindrome.\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1732764219297,"stop":1732764219297,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1732764219301,"stop":1732764219301,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Factorial"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Color Choice"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"bf7dba429c84fe69","status":"passed","time":{"start":1732428194619,"stop":1732428194619,"duration":0}},{"uid":"73622414b649e45a","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}},{"uid":"5392fbee850dfcf4","status":"passed","time":{"start":1724733473124,"stop":1724733473124,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"34a84f898de954b5","status":"passed","time":{"start":1732428194619,"stop":1732428194619,"duration":0}},{"uid":"de04793abb90de01","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}},{"uid":"3d3e842542b066f3","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"64abc8899e8e691d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/64d00badde981bd3.json b/allure-report/data/test-cases/64d00badde981bd3.json deleted file mode 100644 index 99e1ef213c3..00000000000 --- a/allure-report/data/test-cases/64d00badde981bd3.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"64d00badde981bd3","name":"Testing easy_line function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line","historyId":"18d36227a2f56662bc03f08e05241ec1","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e7e4c2d208b9b87","name":"stdout","source":"e7e4c2d208b9b87.txt","type":"text/plain","size":554}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"64d00badde981bd3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/64ddebaa5d6679fc.json b/allure-report/data/test-cases/64ddebaa5d6679fc.json new file mode 100644 index 00000000000..fd729c29233 --- /dev/null +++ b/allure-report/data/test-cases/64ddebaa5d6679fc.json @@ -0,0 +1 @@ +{"uid":"64ddebaa5d6679fc","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1732764220198,"stop":1732764220198,"duration":0},"description":"\n Testing stock_list function with various test data\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1732764220198,"stop":1732764220198,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing stock_list function with various test data\n :return:\n ","descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1732764220198,"stop":1732764220198,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1732764220198,"stop":1732764220198,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1732764220198,"stop":1732764220198,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1732764220198,"stop":1732764220198,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1732764220198,"stop":1732764220198,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1732764220198,"stop":1732764220198,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1732764220200,"stop":1732764220200,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Help the bookseller !"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"64001087ec7aaf2b","status":"passed","time":{"start":1732428195510,"stop":1732428195510,"duration":0}},{"uid":"a98592d8e6c7fba2","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}},{"uid":"296f86e34803d6c1","status":"passed","time":{"start":1724733473960,"stop":1724733473960,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"9267ea7150c527ef","status":"passed","time":{"start":1732428195510,"stop":1732428195510,"duration":0}},{"uid":"1719ddf6913445c8","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}},{"uid":"66511dda8143933e","status":"passed","time":{"start":1724735128820,"stop":1724735128820,"duration":0}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"64ddebaa5d6679fc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f63a88604b1d062f.json b/allure-report/data/test-cases/6558b0da7e100d83.json similarity index 72% rename from allure-report/data/test-cases/f63a88604b1d062f.json rename to allure-report/data/test-cases/6558b0da7e100d83.json index 53e83c067f0..b6814989550 100644 --- a/allure-report/data/test-cases/f63a88604b1d062f.json +++ b/allure-report/data/test-cases/6558b0da7e100d83.json @@ -1 +1 @@ -{"uid":"f63a88604b1d062f","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8dfc11179dd2dd46","name":"stdout","source":"8dfc11179dd2dd46.txt","type":"text/plain","size":601}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"f63a88604b1d062f.json","parameterValues":[]} \ No newline at end of file +{"uid":"6558b0da7e100d83","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d8719a36b49cd420","name":"stdout","source":"d8719a36b49cd420.txt","type":"text/plain","size":601}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRING"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"6558b0da7e100d83.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/55e4a84277d15d0d.json b/allure-report/data/test-cases/6566372edd2dc54c.json similarity index 94% rename from allure-report/data/test-cases/55e4a84277d15d0d.json rename to allure-report/data/test-cases/6566372edd2dc54c.json index e8e0118a880..d7e317b55b6 100644 --- a/allure-report/data/test-cases/55e4a84277d15d0d.json +++ b/allure-report/data/test-cases/6566372edd2dc54c.json @@ -1 +1 @@ -{"uid":"55e4a84277d15d0d","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724735127828,"stop":1724735127828,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"55e4a84277d15d0d.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"6566372edd2dc54c","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724735127828,"stop":1724735127828,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"6566372edd2dc54c.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/656eaa4febf44ace.json b/allure-report/data/test-cases/656eaa4febf44ace.json
deleted file mode 100644
index b5b04141102..00000000000
--- a/allure-report/data/test-cases/656eaa4febf44ace.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"656eaa4febf44ace","name":"a and b are equal","fullName":"kyu_7.disemvowel_trolls.test_disemvowel_trolls.DisemvowelTestCase#test_disemvowel","historyId":"4171a558a2bea15b5a0546d36c9a1c63","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"description":"\n The string \"This website is for losers LOL!\"\n should become \"Ths wbst s fr lsrs LL!\"\n :return:\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"22b576ff182f36ef","name":"stdout","source":"22b576ff182f36ef.txt","type":"text/plain","size":410}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Century From Year"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"d58adc2ec0d31961.json","parameterValues":[]} \ No newline at end of file +{"uid":"65bb39f46c25941f","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6c8cae3bc3627567","name":"stdout","source":"6c8cae3bc3627567.txt","type":"text/plain","size":410}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"story","value":"Century From Year"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"65bb39f46c25941f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f0700b9c803f7cf9.json b/allure-report/data/test-cases/65c772a236576a2d.json similarity index 61% rename from allure-report/data/test-cases/f0700b9c803f7cf9.json rename to allure-report/data/test-cases/65c772a236576a2d.json index 8ace67831c4..85608a71d3b 100644 --- a/allure-report/data/test-cases/f0700b9c803f7cf9.json +++ b/allure-report/data/test-cases/65c772a236576a2d.json @@ -1 +1 @@ -{"uid":"f0700b9c803f7cf9","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5343662cb85dce05","name":"stdout","source":"5343662cb85dce05.txt","type":"text/plain","size":3097}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"RANKING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FILTERING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"f0700b9c803f7cf9.json","parameterValues":[]} \ No newline at end of file +{"uid":"65c772a236576a2d","name":"Testing top_3_words function","fullName":"kyu_4.most_frequently_used_words.test_top_3_words.Top3WordsTestCase#test_top_3_words","historyId":"749ee6e9278a75fb77637153b8003619","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the output","time":{"start":1724735127219,"stop":1724735127219,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f4832c8bd9f79614","name":"stdout","source":"f4832c8bd9f79614.txt","type":"text/plain","size":3097}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"RANKING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FILTERING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"65c772a236576a2d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/65d5a47944859245.json b/allure-report/data/test-cases/65d5a47944859245.json deleted file mode 100644 index c2313ca5d5a..00000000000 --- a/allure-report/data/test-cases/65d5a47944859245.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"65d5a47944859245","name":"Testing the 'unique_in_order' function","fullName":"kyu_6.unique_in_order.test_unique_in_order.UniqueInOrderTestCase#test_unique_in_order","historyId":"9cff2d5d4d73fbc92b1c7c29d738384f","time":{"start":1724733474116,"stop":1724733474116,"duration":0},"description":"\n Testing the 'unique_in_order' function\n with various test data\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1732764221370,"stop":1732764221371,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1732764221377,"stop":1732764221377,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1732764221378,"stop":1732764221378,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"story","value":"Testing gen_primes util"},{"name":"suite","value":"No kyu helper methods"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"f3b1ea272cafb8c8","status":"passed","time":{"start":1732428196503,"stop":1732428196503,"duration":0}},{"uid":"22f939e586318511","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}},{"uid":"40a0fe54277654cc","status":"passed","time":{"start":1724733475038,"stop":1724733475038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"4c77d97bc41048ff","status":"passed","time":{"start":1732428196503,"stop":1732428196503,"duration":0}},{"uid":"35cf25b9e515e00d","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}},{"uid":"928532982127bba0","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"65e9477143af3f55.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/65f6b4f1195a0e9d.json b/allure-report/data/test-cases/65f6b4f1195a0e9d.json new file mode 100644 index 00000000000..95eb1f0158a --- /dev/null +++ b/allure-report/data/test-cases/65f6b4f1195a0e9d.json @@ -0,0 +1 @@ +{"uid":"65f6b4f1195a0e9d","name":"Negative test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_negative","historyId":"4a2df53975623c10d30ec1c6932ba04a","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"bcfe223ecfa6a3c6","name":"stdout","source":"bcfe223ecfa6a3c6.txt","type":"text/plain","size":23}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"65f6b4f1195a0e9d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/66020f911b054e74.json b/allure-report/data/test-cases/66020f911b054e74.json new file mode 100644 index 00000000000..04654db99e6 --- /dev/null +++ b/allure-report/data/test-cases/66020f911b054e74.json @@ -0,0 +1 @@ +{"uid":"66020f911b054e74","name":"Test with one char only","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_one_char","historyId":"e3d629a995491cb3a3079998a04583ff","time":{"start":1732764221218,"stop":1732764221218,"duration":0},"description":"\n Test with one char only\n :return:\n ","descriptionHtml":" Advanced/random test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Advanced/random test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3326f8b00659b17c","name":"stdout","source":"3326f8b00659b17c.txt","type":"text/plain","size":791}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"6c1504a4fcfadf69","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}},{"uid":"a83637127d81f7d9","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"5ea1e8d078b774a7.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"664f2a2d41bf2bd8","name":"test_random","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_random","historyId":"f9568f445cf6471d62f38f61a6e1887d","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"description":"\n Advanced/random test case\n :return:\n ","descriptionHtml":" Advanced/random test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Advanced/random test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1f6883e774d20c18","name":"stdout","source":"1f6883e774d20c18.txt","type":"text/plain","size":791}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"5ea1e8d078b774a7","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}},{"uid":"6c1504a4fcfadf69","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}},{"uid":"a83637127d81f7d9","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"664f2a2d41bf2bd8.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/b673d7ca3af16ae5.json b/allure-report/data/test-cases/6650fdbb71631571.json
similarity index 59%
rename from allure-report/data/test-cases/b673d7ca3af16ae5.json
rename to allure-report/data/test-cases/6650fdbb71631571.json
index 512073ccfb8..e20a84079ad 100644
--- a/allure-report/data/test-cases/b673d7ca3af16ae5.json
+++ b/allure-report/data/test-cases/6650fdbb71631571.json
@@ -1 +1 @@
-{"uid":"b673d7ca3af16ae5","name":"Testing 'sum_triangular_numbers' with negative numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_negative_numbers","historyId":"4e553d5e3ff5fc5c21a746a843af96e5","time":{"start":1732428196017,"stop":1732428196017,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with negative numbers\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1732764219259,"stop":1732764219259,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing binary_to_string function\n with various test data\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1732764219259,"stop":1732764219259,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1732764219259,"stop":1732764219259,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1732764219259,"stop":1732764219259,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1732764219259,"stop":1732764219259,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1732764219259,"stop":1732764219259,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1732764219262,"stop":1732764219262,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Character Encodings"},{"name":"tag","value":"ASCII"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BINARY"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"tag","value":"FORMATS"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d5360156ef396b6e","status":"passed","time":{"start":1732428194577,"stop":1732428194577,"duration":0}},{"uid":"cedf72c8fbbfdfc5","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"a22d4b8f003df599","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"1d2104b5fa1d29b","status":"passed","time":{"start":1732428194577,"stop":1732428194577,"duration":0}},{"uid":"2b38fe6b8a5a46","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"5c281d5272513bfd","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["CHARACTER ENCODINGS","STRINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"67a0bf67db9047ee.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d9328098007f6ade.json b/allure-report/data/test-cases/67c96b92db3f1ee1.json similarity index 51% rename from allure-report/data/test-cases/d9328098007f6ade.json rename to allure-report/data/test-cases/67c96b92db3f1ee1.json index de7d8fe15f7..8fff1b8c1e5 100644 --- a/allure-report/data/test-cases/d9328098007f6ade.json +++ b/allure-report/data/test-cases/67c96b92db3f1ee1.json @@ -1 +1 @@ -{"uid":"d9328098007f6ade","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an un-existing item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a2cc2be21cb9d7cd","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"45f16c4708137d2d","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"99a050e28b9f808c","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"a33fb2570aec1823","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"d9328098007f6ade.json","parameterValues":[]} \ No newline at end of file +{"uid":"67c96b92db3f1ee1","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an un-existing item and verify the result","time":{"start":1732428194672,"stop":1732428194672,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"67c96b92db3f1ee1.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/67e470215248af57.json b/allure-report/data/test-cases/67e470215248af57.json new file mode 100644 index 00000000000..95cd51da433 --- /dev/null +++ b/allure-report/data/test-cases/67e470215248af57.json @@ -0,0 +1 @@ +{"uid":"67e470215248af57","name":"Testing decipher_this function","fullName":"kyu_6.decipher_this.test_decipher_this.DecipherThisTestCase#test_decipher_this","historyId":"ae3e8fd54712dd8496499b7bc14e7226","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"description":"\n Testing decipher_this function\n :param self:\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"697ce25e72082ee1","name":"stdout","source":"697ce25e72082ee1.txt","type":"text/plain","size":304}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"32b8a7a180fb722f.json","parameterValues":[]} \ No newline at end of file +{"uid":"681eea057133a7e0","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"18e75387bd3b0160","name":"stdout","source":"18e75387bd3b0160.txt","type":"text/plain","size":304}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"681eea057133a7e0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/53ac096f64d86d36.json b/allure-report/data/test-cases/68235061ff0b1d1d.json similarity index 75% rename from allure-report/data/test-cases/53ac096f64d86d36.json rename to allure-report/data/test-cases/68235061ff0b1d1d.json index 0fc7948da7e..44d39ca1074 100644 --- a/allure-report/data/test-cases/53ac096f64d86d36.json +++ b/allure-report/data/test-cases/68235061ff0b1d1d.json @@ -1 +1 @@ -{"uid":"53ac096f64d86d36","name":"Testing 'count_sheeps' function: positive flow","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep","historyId":"7c789f6ee990c99f027ff5b8c32573fd","time":{"start":1724735129414,"stop":1724735129414,"duration":0},"description":"\n Testing 'count_sheeps' function\n Consider an array of sheep where some sheep\n may be missing from their place.\n We need a function that counts the\n number of sheep present in the array\n (true means present).\n\n :return:\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Permutations"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f12b5c3f29ddd74a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"ef2d26c76c436892","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"1319e1ae94efdc02","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"6fbcaa806475fb37","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"4942ac4be65ef1b0.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"682ca0c47ecc45d4","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1732428193998,"stop":1732428193998,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Permutations"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"682ca0c47ecc45d4.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/f97aaf8957be0a89.json b/allure-report/data/test-cases/68489cf8ea35171c.json
similarity index 66%
rename from allure-report/data/test-cases/f97aaf8957be0a89.json
rename to allure-report/data/test-cases/68489cf8ea35171c.json
index a068bc7fe67..697eeb2cdc1 100644
--- a/allure-report/data/test-cases/f97aaf8957be0a89.json
+++ b/allure-report/data/test-cases/68489cf8ea35171c.json
@@ -1 +1 @@
-{"uid":"f97aaf8957be0a89","name":"get_size function tests","fullName":"kyu_8.surface_area_and_volume_of_box.test_get_size.GetSizeTestCase#test_get_size","historyId":"ecc1f7419b2f77621f5c909f1d0df9a9","time":{"start":1724733474897,"stop":1724733474913,"duration":16},"description":"\n Testing get_size function with various inputs\n :return:\n ","descriptionHtml":" Testing using big test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 70, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f11813f80ada0713","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"3aa67525242f5614","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"a6bf4a932c1ec147","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"6827fd264cb4d263","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c42292a9c36c46f3.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"68a2b9760a533e02","name":"test_solution_big","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_big","historyId":"128bd70e221c2c2b932b5e8d4fdb22c0","time":{"start":1732428194190,"stop":1732428194190,"duration":0},"description":"\n Testing using big test data\n :return:\n ","descriptionHtml":" Testing using big test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 70, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"68a2b9760a533e02.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/933ecb6fe52a564f.json b/allure-report/data/test-cases/68ad711bfb950e6e.json
similarity index 78%
rename from allure-report/data/test-cases/933ecb6fe52a564f.json
rename to allure-report/data/test-cases/68ad711bfb950e6e.json
index 5048664f86e..74d8dceef66 100644
--- a/allure-report/data/test-cases/933ecb6fe52a564f.json
+++ b/allure-report/data/test-cases/68ad711bfb950e6e.json
@@ -1 +1 @@
-{"uid":"933ecb6fe52a564f","name":"Testing set_alarm function","fullName":"kyu_8.set_alarm.test_set_alarm.SetAlarmTestCase#test_set_alarm","historyId":"77c7125894dc4635fdd1db51405959d3","time":{"start":1724735129664,"stop":1724735129664,"duration":0},"description":"\n Testing set_alarm function with various test inputs.\n\n The function should return true if you are employed\n and not on vacation (because these are the circumstances\n under which you need to set an alarm). It should return\n false otherwise.\n\n Examples:\n\n setAlarm(true, true) -> false\n setAlarm(false, true) -> false\n setAlarm(false, false) -> false\n setAlarm(true, false) -> true\n :return:\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string aba and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string moOse and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"974d8c9279e15557","name":"stdout","source":"974d8c9279e15557.txt","type":"text/plain","size":401}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Isograms"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"String"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"691701add6daaf89.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fda81d5edcbfeda5.json b/allure-report/data/test-cases/696e651c40149097.json similarity index 57% rename from allure-report/data/test-cases/fda81d5edcbfeda5.json rename to allure-report/data/test-cases/696e651c40149097.json index 790ecced21f..58529d44326 100644 --- a/allure-report/data/test-cases/fda81d5edcbfeda5.json +++ b/allure-report/data/test-cases/696e651c40149097.json @@ -1 +1 @@ -{"uid":"fda81d5edcbfeda5","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1732428196158,"stop":1732428196158,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1f14a6ccebe34b08","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}},{"uid":"920950efadf9f044","status":"passed","time":{"start":1724733474632,"stop":1724733474632,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"9f7fc4731241a976","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}},{"uid":"cd298347a8b67e93","status":"passed","time":{"start":1724735129446,"stop":1724735129446,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"fda81d5edcbfeda5.json","parameterValues":[]} \ No newline at end of file +{"uid":"696e651c40149097","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1732428196156,"stop":1732428196156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1732428196158,"stop":1732428196158,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"696e651c40149097.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6a3f85e29591c654.json b/allure-report/data/test-cases/6a3f85e29591c654.json new file mode 100644 index 00000000000..1f801a116c3 --- /dev/null +++ b/allure-report/data/test-cases/6a3f85e29591c654.json @@ -0,0 +1 @@ +{"uid":"6a3f85e29591c654","name":"Testing domain_name function","fullName":"kyu_5.extract_the_domain_name_from_url.test_domain_name.DomainNameTestCase#test_domain_name","historyId":"cd64b52319d4c70d68e281e8561ab97f","time":{"start":1732764218869,"stop":1732764218871,"duration":2},"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1732764218869,"stop":1732764218869,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732764218869,"stop":1732764218869,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1732764218869,"stop":1732764218869,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1732764218869,"stop":1732764218869,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1732764218869,"stop":1732764218869,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1732764218872,"stop":1732764218872,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"PARSING"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"950acbfbefb81796","status":"passed","time":{"start":1732428194216,"stop":1732428194216,"duration":0}},{"uid":"e0d2f09c0da8121","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}},{"uid":"13c4343c88a790e8","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"2b89947e3a3ec46d","status":"passed","time":{"start":1732428194216,"stop":1732428194216,"duration":0}},{"uid":"627da61e5891aa44","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}},{"uid":"d8e9539521c4ca00","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"6a3f85e29591c654.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6a636a909012a6f0.json b/allure-report/data/test-cases/6a636a909012a6f0.json new file mode 100644 index 00000000000..dde92d83dc4 --- /dev/null +++ b/allure-report/data/test-cases/6a636a909012a6f0.json @@ -0,0 +1 @@ +{"uid":"6a636a909012a6f0","name":"move function tests","fullName":"kyu_8.terminal_game_move_function.test_terminal_game_move_function.MoveTestCase#test_move","historyId":"c589035c90d432fb71a99aec4f56ee9e","time":{"start":1732764221258,"stop":1732764221259,"duration":1},"description":"\n The player rolls the dice and moves the number\n of spaces indicated by the dice two times.\n\n Pass position and roll and compare the output\n to the expected result\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f965c0bd2baa205","name":"stdout","source":"f965c0bd2baa205.txt","type":"text/plain","size":502}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"6a8f943df9cf325c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2b98fb3b88f75199.json b/allure-report/data/test-cases/6aa550180790876d.json similarity index 59% rename from allure-report/data/test-cases/2b98fb3b88f75199.json rename to allure-report/data/test-cases/6aa550180790876d.json index 901854975b5..6960cb3f444 100644 --- a/allure-report/data/test-cases/2b98fb3b88f75199.json +++ b/allure-report/data/test-cases/6aa550180790876d.json @@ -1 +1 @@ -{"uid":"2b98fb3b88f75199","name":"Testing zeros function","fullName":"kyu_5.number_of_trailing_zeros_of_n.test_zeros.ZerosTestCase#test_zeros","historyId":"bf37412e0e610d07d951e5fde674ec97","time":{"start":1732428194480,"stop":1732428194480,"duration":0},"description":"\n Testing 'zeros' program that should calculate the number\n of trailing zeros in a factorial of a given number.\n :return: None\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 38, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"55e4a84277d15d0d","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}},{"uid":"a8b77a6618ff7e4c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472921,"stop":1724733472921,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"84fd4c67efee5295","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}},{"uid":"62bf772c3a2aa5d2","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}}]},"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"70eff3ae24ccc67a.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"6aba04a431b7fd70","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1732428194439,"stop":1732428194439,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 38, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"story","value":"Josephus Survivor"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"6aba04a431b7fd70.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/f649ed8d3c87f7f8.json b/allure-report/data/test-cases/6aeb83ca0df8b3d8.json
similarity index 72%
rename from allure-report/data/test-cases/f649ed8d3c87f7f8.json
rename to allure-report/data/test-cases/6aeb83ca0df8b3d8.json
index 996b6393fa3..5d37f1577b7 100644
--- a/allure-report/data/test-cases/f649ed8d3c87f7f8.json
+++ b/allure-report/data/test-cases/6aeb83ca0df8b3d8.json
@@ -1 +1 @@
-{"uid":"f649ed8d3c87f7f8","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_test","historyId":"eb0582ce0674121869dd4f6fce46e7f3","time":{"start":1724733474538,"stop":1724733474538,"duration":0},"description":"\n 3 is not a square number\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase","time":{"start":1732764220401,"stop":1732764220401,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing likes function with various test data\n :return:\n ","descriptionHtml":"The function should take in input array, containing the names of people who like an item. It must return the display text. For 4 or more names, the number in and 2 others simply increases.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764220402,"stop":1732764220402,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_LikesTestCase::0","time":{"start":1732764220403,"stop":1732764220403,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Who likes it?"},{"name":"tag","value":"FORMATTING"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.who_likes_it.test_likes_function"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5266876b8f4bf2da9b000362","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2e0eb113649e95e6","status":"passed","time":{"start":1732428195706,"stop":1732428195706,"duration":0}},{"uid":"4617147ad7612076","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}},{"uid":"168ffd09c766442f","status":"passed","time":{"start":1724733474132,"stop":1724733474132,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"fb237eeb673713e3","status":"passed","time":{"start":1732428195706,"stop":1732428195706,"duration":0}},{"uid":"d7357eaa8c15ec47","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}},{"uid":"57946e73be805e2a","status":"passed","time":{"start":1724735128992,"stop":1724735128992,"duration":0}}]},"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"6bab07231bfb8a25.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/21f08ae936e1de27.json b/allure-report/data/test-cases/6bf2acd0a0db42e5.json similarity index 59% rename from allure-report/data/test-cases/21f08ae936e1de27.json rename to allure-report/data/test-cases/6bf2acd0a0db42e5.json index afaab650531..fd0da988e1b 100644 --- a/allure-report/data/test-cases/21f08ae936e1de27.json +++ b/allure-report/data/test-cases/6bf2acd0a0db42e5.json @@ -1 +1 @@ -{"uid":"21f08ae936e1de27","name":"Testing length function where head = None","fullName":"kyu_7.fun_with_lists_length.test_length.LengthTestCase#test_length_none","historyId":"2ab55d25b4f71b0a35e531ab6cae710e","time":{"start":1732428195838,"stop":1732428195839,"duration":1},"description":"\n Testing length function\n where head = None\n\n The method length, which accepts a linked list\n (head), and returns the length of the list.\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"6d7f7d9659ba7dd5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/91c9b008755c7351.json b/allure-report/data/test-cases/6d9aec252d158762.json similarity index 70% rename from allure-report/data/test-cases/91c9b008755c7351.json rename to allure-report/data/test-cases/6d9aec252d158762.json index 093a9481fe8..c7f5acc97c7 100644 --- a/allure-report/data/test-cases/91c9b008755c7351.json +++ b/allure-report/data/test-cases/6d9aec252d158762.json @@ -1 +1 @@ -{"uid":"91c9b008755c7351","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1732428194039,"stop":1732428194040,"duration":1},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1732428194039,"stop":1732428194039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1732428194042,"stop":1732428194042,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"feature","value":"Validation"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5319ceacad5a43bc","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}},{"uid":"f7656bca6b03073b","status":"passed","time":{"start":1724733472437,"stop":1724733472437,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d6e4ebd44034ff08","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}},{"uid":"af3c309699fc2b8b","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}}]},"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"91c9b008755c7351.json","parameterValues":[]} \ No newline at end of file +{"uid":"6d9aec252d158762","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1732428194039,"stop":1732428194040,"duration":1},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1732428194039,"stop":1732428194039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1732428194040,"stop":1732428194040,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1732428194042,"stop":1732428194042,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"feature","value":"Validation"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"6d9aec252d158762.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6de398181d9095ee.json b/allure-report/data/test-cases/6de398181d9095ee.json new file mode 100644 index 00000000000..10a34ba9432 --- /dev/null +++ b/allure-report/data/test-cases/6de398181d9095ee.json @@ -0,0 +1 @@ +{"uid":"6de398181d9095ee","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5d705772211817a","name":"stdout","source":"5d705772211817a.txt","type":"text/plain","size":2817}],"parameters":[],"stepsCount":30,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"6de398181d9095ee.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6dfafb882d7cc41f.json b/allure-report/data/test-cases/6dfafb882d7cc41f.json new file mode 100644 index 00000000000..5781455fdd0 --- /dev/null +++ b/allure-report/data/test-cases/6dfafb882d7cc41f.json @@ -0,0 +1 @@ +{"uid":"6dfafb882d7cc41f","name":"Wolf at the end of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_at_end","historyId":"e15f1973b9fdb38f6fac61e3b46f93cc","time":{"start":1732764221330,"stop":1732764221330,"duration":0},"description":"\n If the wolf is not the closest animal to you,\n return \"Oi! Sheep number N! You are about to be eaten by a wolf!\"\n where N is the sheep's position in the queue.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 38, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Josephus Survivor"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6aba04a431b7fd70","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194439,"stop":1732428194439,"duration":0}},{"uid":"6566372edd2dc54c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}},{"uid":"c264906d7bf954d5","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472921,"stop":1724733472921,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"70eff3ae24ccc67a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194439,"stop":1732428194439,"duration":0}},{"uid":"84fd4c67efee5295","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}},{"uid":"62bf772c3a2aa5d2","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127828,"stop":1724735127828,"duration":0}}]},"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"6ef44675aea47099.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/2e46c970e553e301.json b/allure-report/data/test-cases/6f37cee94115c50c.json
similarity index 64%
rename from allure-report/data/test-cases/2e46c970e553e301.json
rename to allure-report/data/test-cases/6f37cee94115c50c.json
index 4c9a033a140..755e43d221e 100644
--- a/allure-report/data/test-cases/2e46c970e553e301.json
+++ b/allure-report/data/test-cases/6f37cee94115c50c.json
@@ -1 +1 @@
-{"uid":"2e46c970e553e301","name":"Testing 'has_subpattern' (part 2) function","fullName":"kyu_6.string_subpattern_recognition_2.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"3086879b276d25b4dd0f45ada5d9f20b","time":{"start":1732428195651,"stop":1732428195651,"duration":0},"description":"\n Verify that 'has_subpattern' function to returns\n either true/True or false/False if a string can be\n seen as the repetition of a simpler/shorter subpattern or not.\n\n 1. if a subpattern has been used, it will be repeated\n at least twice, meaning the subpattern has to be\n shorter than the original string;\n\n 2. the strings you will be given might or might not\n be created repeating a given subpattern, then\n shuffling the result.\n :return:\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert training","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert battle","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1e123d763e6ea7e5","name":"stdout","source":"1e123d763e6ea7e5.txt","type":"text/plain","size":67}],"parameters":[],"hasContent":true,"stepsCount":12,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"1938e37bf1525466.json","parameterValues":[]} \ No newline at end of file +{"uid":"70c180d1e9f40ddc","name":"Testing Warrior class >>> bruce_lee","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_bruce_lee","historyId":"7af7e9479cf2a47a636ae35231bacc9f","time":{"start":1724735127407,"stop":1724735127422,"duration":15},"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert training","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert battle","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert achievements","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4b36d71052a1b866","name":"stdout","source":"4b36d71052a1b866.txt","type":"text/plain","size":67}],"parameters":[],"stepsCount":12,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"The Greatest Warrior"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"70c180d1e9f40ddc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/649728966aa92b06.json b/allure-report/data/test-cases/710a5d14f0382e2f.json similarity index 60% rename from allure-report/data/test-cases/649728966aa92b06.json rename to allure-report/data/test-cases/710a5d14f0382e2f.json index 78d1eb82c6b..e7c533aa60b 100644 --- a/allure-report/data/test-cases/649728966aa92b06.json +++ b/allure-report/data/test-cases/710a5d14f0382e2f.json @@ -1 +1 @@ -{"uid":"649728966aa92b06","name":"Testing max_multiple function","fullName":"kyu_7.maximum_multiple.test_maximum_multiple.MaximumMultipleTestCase#test_maximum_multiple","historyId":"3181c0c2e1c9ba7b49a9f72369c7b0bb","time":{"start":1732428195890,"stop":1732428195890,"duration":0},"description":"\n Testing max_multiple function with\n various test data\n\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1732428194708,"stop":1732428194708,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1732428195425,"stop":1732428195425,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1732428195438,"stop":1732428195438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Diagonal"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b1f2cc8e1be032d","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}},{"uid":"6113acbf67a69117","status":"passed","time":{"start":1724733473218,"stop":1724733473889,"duration":671}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"964ad50f448ed64d","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}},{"uid":"7f2ec06c200d3086","status":"passed","time":{"start":1724735128094,"stop":1724735128742,"duration":648}}]},"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"56da494ae1701253.json","parameterValues":[]} \ No newline at end of file +{"uid":"711b3df283530a5b","name":"Testing easy_diagonal function","fullName":"kyu_6.easy_diagonal.test_diagonal.EasyDiagonalTestCase#test_easy_diagonal","historyId":"5d9c9166bf610b28a284723b5b23aab1","time":{"start":1732428194708,"stop":1732428195425,"duration":717},"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1732428194708,"stop":1732428194708,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1732428194710,"stop":1732428194710,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1732428195425,"stop":1732428195425,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1732428195438,"stop":1732428195438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Diagonal"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"711b3df283530a5b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/90184d6eca761182.json b/allure-report/data/test-cases/71a05925458c8736.json similarity index 71% rename from allure-report/data/test-cases/90184d6eca761182.json rename to allure-report/data/test-cases/71a05925458c8736.json index ef71cfeda3d..7ac627e17a9 100644 --- a/allure-report/data/test-cases/90184d6eca761182.json +++ b/allure-report/data/test-cases/71a05925458c8736.json @@ -1 +1 @@ -{"uid":"90184d6eca761182","name":"Testing 'sum_triangular_numbers' with positive numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_positive_numbers","historyId":"135e62f837ca5fe30ddfd2ad875e089b","time":{"start":1724735129305,"stop":1724735129305,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with positive numbers\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428194233,"stop":1732428194233,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8dcfddf689f44d1d","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"b080152571ac4adf","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"645c6c05562d2f01","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"34569132e9551c33","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"5cd4eeb8a4b79d6b.json","parameterValues":[]} \ No newline at end of file +{"uid":"71a87e59b6648413","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1732428194232,"stop":1732428194233,"duration":1},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428194233,"stop":1732428194233,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"71a87e59b6648413.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/167f34fe4187417a.json b/allure-report/data/test-cases/71dc0d8169aaad6f.json similarity index 52% rename from allure-report/data/test-cases/167f34fe4187417a.json rename to allure-report/data/test-cases/71dc0d8169aaad6f.json index 128657f34ad..53733da285b 100644 --- a/allure-report/data/test-cases/167f34fe4187417a.json +++ b/allure-report/data/test-cases/71dc0d8169aaad6f.json @@ -1 +1 @@ -{"uid":"167f34fe4187417a","name":"Testing gap function","fullName":"kyu_7.find_the_longest_gap.test_gap.GapTestCase#test_gap","historyId":"629f8f3c77ceed21b9aefeb6ebebc433","time":{"start":1724733474257,"stop":1724733474257,"duration":0},"description":"\n Testing gap function with various test inputs\n\n A binary gap within a positive number num is\n any sequence of consecutive zeros that is\n surrounded by ones at both ends in the binary\n representation of num.\n\n The gap function should return the length of\n its longest binary gap.\n\n The function should return 0 if num doesn't\n contain a binary gap.\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1732428196491,"stop":1732428196491,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"c8c44a676a12b5c6","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"e427c3eece0f34c3","status":"passed","time":{"start":1724733475007,"stop":1724733475007,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"b97e3a9bf54f17f3","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"73d92f8f0c07772d","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"54bb63fb3736b8ae.json","parameterValues":[]} \ No newline at end of file +{"uid":"71f8f5b376b254cf","name":"Negative test cases for is_prime function testing","fullName":"utils.primes.test_is_prime.IsPrimeTestCase#test_is_prime_negative","historyId":"2dc5f3dd0a3e6e7beee8f439047c4032","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Negative test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1732428196482,"stop":1732428196482,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1732428196491,"stop":1732428196491,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"71f8f5b376b254cf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/720b65d3a7d8ec34.json b/allure-report/data/test-cases/720b65d3a7d8ec34.json new file mode 100644 index 00000000000..e231a11ad19 --- /dev/null +++ b/allure-report/data/test-cases/720b65d3a7d8ec34.json @@ -0,0 +1 @@ +{"uid":"720b65d3a7d8ec34","name":"Testing all_fibonacci_numbers function","fullName":"kyu_5.fibonacci_streaming.test_all_fibonacci_numbers.AllFibonacciNumbersTestCase#test_all_fibonacci_numbers","historyId":"a7b5f0a3a7cd2fe8faed75e5c4a52138","time":{"start":1732764218877,"stop":1732764218877,"duration":0},"description":"\n Testing all_fibonacci_numbers function\n\n You're going to provide a needy programmer a\n utility method that generates an infinite sized,\n sequential IntStream (in Python generator)\n which contains all the numbers in a fibonacci\n sequence.\n\n A fibonacci sequence starts with two 1s.\n Every element afterwards is the sum of\n the two previous elements.\n :return:\n ","descriptionHtml":"Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1732764220449,"stop":1732764220449,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732764220449,"stop":1732764220452,"duration":3},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1732764220453,"stop":1732764220453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"tag","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"Strings"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"7 kyu"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a25ac6ac5e284cfbe000111","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d5d01c4fe30779a0","status":"passed","time":{"start":1732428195758,"stop":1732428195759,"duration":1}},{"uid":"e5a7c04cf0e6c2f9","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"3ffa72675847f113","status":"passed","time":{"start":1732428195758,"stop":1732428195759,"duration":1}},{"uid":"7e0d94f0ee4e397d","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}},{"uid":"2d65aaadaa20d5c2","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"732b9dd805d734b8.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/7331de8e7202ad57.json b/allure-report/data/test-cases/7331de8e7202ad57.json
new file mode 100644
index 00000000000..6fbbdbb0ba7
--- /dev/null
+++ b/allure-report/data/test-cases/7331de8e7202ad57.json
@@ -0,0 +1 @@
+{"uid":"7331de8e7202ad57","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1732764218698,"stop":1732764218753,"duration":55},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1732764218697,"stop":1732764218697,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1732764218699,"stop":1732764218699,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1732764218699,"stop":1732764218699,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1732764218699,"stop":1732764218699,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1732764218753,"stop":1732764218753,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1732764218753,"stop":1732764218753,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1732764218753,"stop":1732764218753,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1732764218753,"stop":1732764218753,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1732764218763,"stop":1732764218763,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"Sum by Factors"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4b22647a9cdd2bef","status":"passed","time":{"start":1732428194048,"stop":1732428194108,"duration":60}},{"uid":"ce75fbdf4ccd46b8","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}},{"uid":"30ac3ffad3316fea","status":"passed","time":{"start":1724733472452,"stop":1724733472499,"duration":47}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"aa08a95162404297","status":"passed","time":{"start":1732428194048,"stop":1732428194108,"duration":60}},{"uid":"82619e3fb0e84d4d","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}},{"uid":"521b14729542d5c4","status":"passed","time":{"start":1724735127313,"stop":1724735127391,"duration":78}}]},"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"7331de8e7202ad57.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e186c7a758de768a.json b/allure-report/data/test-cases/73622414b649e45a.json similarity index 72% rename from allure-report/data/test-cases/e186c7a758de768a.json rename to allure-report/data/test-cases/73622414b649e45a.json index 23fd5a42a6b..b116c58d56e 100644 --- a/allure-report/data/test-cases/e186c7a758de768a.json +++ b/allure-report/data/test-cases/73622414b649e45a.json @@ -1 +1 @@ -{"uid":"e186c7a758de768a","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"73d36ba66285cf8e","name":"stdout","source":"73d36ba66285cf8e.txt","type":"text/plain","size":428}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Factorial"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Color Choice"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"e186c7a758de768a.json","parameterValues":[]} \ No newline at end of file +{"uid":"73622414b649e45a","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"bc75ae4e4dd30a2d","name":"stdout","source":"bc75ae4e4dd30a2d.txt","type":"text/plain","size":428}],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Factorial"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Color Choice"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"73622414b649e45a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7369f3dde824b045.json b/allure-report/data/test-cases/7369f3dde824b045.json new file mode 100644 index 00000000000..dc98b1f762f --- /dev/null +++ b/allure-report/data/test-cases/7369f3dde824b045.json @@ -0,0 +1 @@ +{"uid":"7369f3dde824b045","name":"Testing check_exam function","fullName":"kyu_8.check_the_exam.test_check_exam.CheckExamTestCase#test_check_exam","historyId":"ed6c1e5f0eb38874fc66b7fa53f68e12","time":{"start":1724733474569,"stop":1724733474569,"duration":0},"description":"\n Testing check_exam function\n\n The function should return the score\n for this array of answers, giving +4\n for each correct answer, -1 for each\n incorrect answer, and +0 for each blank\n answer(empty string).\n\n :return:\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Permutations"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"f12b5c3f29ddd74a.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"740e72b931a3ed2d","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Permutations"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"PERMUTATIONS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"740e72b931a3ed2d.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/1cf942af51db20a3.json b/allure-report/data/test-cases/741a61f0f9cb4c37.json
similarity index 75%
rename from allure-report/data/test-cases/1cf942af51db20a3.json
rename to allure-report/data/test-cases/741a61f0f9cb4c37.json
index 5fed3e42d85..096a239b7ef 100644
--- a/allure-report/data/test-cases/1cf942af51db20a3.json
+++ b/allure-report/data/test-cases/741a61f0f9cb4c37.json
@@ -1 +1 @@
-{"uid":"1cf942af51db20a3","name":"Testing the 'solution' function","fullName":"kyu_6.multiples_of_3_or_5.test_solution.SolutionTestCase#test_solution","historyId":"c387db789a67b80c29f3c3ba2e6c9bce","time":{"start":1724733473976,"stop":1724733473976,"duration":0},"description":"\n Testing solution function\n\n If we list all the natural numbers below 10\n that are multiples of 3 or 5, we get 3, 5, 6 and 9.\n The sum of these multiples is 23.\n\n Finish the solution so that it returns the sum of\n all the multiples of 3 or 5 below the number passed in.\n\n Note: If the number is a multiple of both 3 and 5,\n only count it once.\n :return:\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f24a53f1fea24b32","name":"stdout","source":"f24a53f1fea24b32.txt","type":"text/plain","size":601}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"89c602359c6f109b.json","parameterValues":[]} \ No newline at end of file +{"uid":"747c525d425e0efa","name":"Testing solution function","fullName":"kyu_4.range_extraction.test_solution.SolutionTestCase#test_solution","historyId":"0ca6c261f6caf983cecc5d9fa898244b","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2857c06d429f0757","name":"stdout","source":"2857c06d429f0757.txt","type":"text/plain","size":601}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1724733472405,"stop":1724733472405,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Range Extraction"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"747c525d425e0efa.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d04b40a520c97bdd.json b/allure-report/data/test-cases/749bcfd3f56dec1a.json similarity index 56% rename from allure-report/data/test-cases/d04b40a520c97bdd.json rename to allure-report/data/test-cases/749bcfd3f56dec1a.json index a96cdc4ebd9..1007c47a518 100644 --- a/allure-report/data/test-cases/d04b40a520c97bdd.json +++ b/allure-report/data/test-cases/749bcfd3f56dec1a.json @@ -1 +1 @@ -{"uid":"d04b40a520c97bdd","name":"Should return 'I smell a series!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_series","historyId":"fd37424f9957f0d1afe768cce5a8cc08","time":{"start":1732428196435,"stop":1732428196436,"duration":1},"description":"\n if there are more than 2 return\n 'I smell a series!'.\n :return:\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1732428194139,"stop":1732428194139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> bruce_lee\n ","descriptionHtml":"Advanced Warrior class assertions
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> bruce_lee","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert training","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert battle","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert achievements","time":{"start":1732428194141,"stop":1732428194141,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":12,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1732428194147,"stop":1732428194147,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1938e37bf1525466","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}},{"uid":"286a2c6d22a3ea0b","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"37b95a78feb35857","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}},{"uid":"bc3230f80ad8864d","status":"passed","time":{"start":1724735127407,"stop":1724735127422,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"751027d0ac0cc021.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/74c746ac3dc42135.json b/allure-report/data/test-cases/756610bb1a8856d4.json similarity index 66% rename from allure-report/data/test-cases/74c746ac3dc42135.json rename to allure-report/data/test-cases/756610bb1a8856d4.json index 60b22b72335..6be73e432c7 100644 --- a/allure-report/data/test-cases/74c746ac3dc42135.json +++ b/allure-report/data/test-cases/756610bb1a8856d4.json @@ -1 +1 @@ -{"uid":"74c746ac3dc42135","name":"You are given two angles -> find the 3rd.","fullName":"kyu_8.third_angle_of_triangle.test_third_angle_of_triangle.OtherAngleTestCase#test_other_angle","historyId":"6630066bed88b9c8246478bc4b94ac73","time":{"start":1724735129695,"stop":1724735129695,"duration":0},"description":"\n You are given two angles (in degrees) of a triangle.\n Find the 3rd.\n :return:\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isogram and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string aba and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string moOse and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1732428195862,"stop":1732428195862,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"428efcfcd43d2531","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}},{"uid":"691701add6daaf89","status":"passed","time":{"start":1724733474304,"stop":1724733474304,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"cd862d92408a60a2","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}},{"uid":"3bd61bc704b417e2","status":"passed","time":{"start":1724735129149,"stop":1724735129149,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"2c6c8c712bf1892f.json","parameterValues":[]} \ No newline at end of file +{"uid":"7567c87108e55931","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isogram and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string aba and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string moOse and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the result","time":{"start":1732428195861,"stop":1732428195861,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1732428195862,"stop":1732428195862,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"7567c87108e55931.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/345a3bae73357330.json b/allure-report/data/test-cases/75a0786e7098fd84.json similarity index 52% rename from allure-report/data/test-cases/345a3bae73357330.json rename to allure-report/data/test-cases/75a0786e7098fd84.json index 05e90f5b516..850570585dd 100644 --- a/allure-report/data/test-cases/345a3bae73357330.json +++ b/allure-report/data/test-cases/75a0786e7098fd84.json @@ -1 +1 @@ -{"uid":"345a3bae73357330","name":"Testing period_is_late function (negative)","fullName":"kyu_8.is_your_period_late.test_is_your_period_late.PeriodIsLateTestCase#test_period_is_late_negative","historyId":"3ade0b8dc3a70452a99ea470cea361ac","time":{"start":1732428196265,"stop":1732428196265,"duration":0},"description":"\n Negative tests\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2d58a8a8ac8fa12e","name":"stdout","source":"2d58a8a8ac8fa12e.txt","type":"text/plain","size":949}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"f7656bca6b03073b.json","parameterValues":[]} \ No newline at end of file +{"uid":"7677af29e8a1671e","name":"Testing validSolution","fullName":"kyu_4.sudoku_solution_validator.test_valid_solution.ValidSolutionTestCase#test_valid_solution","historyId":"a5e357785cf7a1184adb35707a6c5d0c","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"3e106a35f51e50cd","name":"stdout","source":"3e106a35f51e50cd.txt","type":"text/plain","size":949}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1724733472437,"stop":1724733472437,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"feature","value":"Validation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"7677af29e8a1671e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2b5d1a28c2e7859f.json b/allure-report/data/test-cases/767acc864b347295.json similarity index 94% rename from allure-report/data/test-cases/2b5d1a28c2e7859f.json rename to allure-report/data/test-cases/767acc864b347295.json index f7479b18fb2..b3e8c346c0c 100644 --- a/allure-report/data/test-cases/2b5d1a28c2e7859f.json +++ b/allure-report/data/test-cases/767acc864b347295.json @@ -1 +1 @@ -{"uid":"2b5d1a28c2e7859f","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the smallest"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"2b5d1a28c2e7859f.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"767acc864b347295","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests") with\n\n 1) the smallest number you got\n 2) the index i of the digit d you took, i as small as possible\n 3) the index j (as small as possible) where you insert this digit d to have the smallest number.\n\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the smallest"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"767acc864b347295.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/3c3a8d947ad77b59.json b/allure-report/data/test-cases/76b07a3b0b784bd3.json
similarity index 54%
rename from allure-report/data/test-cases/3c3a8d947ad77b59.json
rename to allure-report/data/test-cases/76b07a3b0b784bd3.json
index 1e13bb84dbe..09b8b55c1b6 100644
--- a/allure-report/data/test-cases/3c3a8d947ad77b59.json
+++ b/allure-report/data/test-cases/76b07a3b0b784bd3.json
@@ -1 +1 @@
-{"uid":"3c3a8d947ad77b59","name":"Square numbers (positive)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_four","historyId":"861b34050c3ab0a994fa20a6090c5ab5","time":{"start":1732428196069,"stop":1732428196070,"duration":1},"description":"\n 4 is a square number\n :return:\n ","descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase","time":{"start":1724735127938,"stop":1724735127938,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that processes sequence of operations on an integer n (>=0). 'thirt' should return the stationary number.
","status":"passed","steps":[{"name":"Enter a n (1234567) and verify the expected output (87) vs actual result (87)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (321) and verify the expected output (48) vs actual result (48)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (8529) and verify the expected output (79) vs actual result (79)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (85299258) and verify the expected output (31) vs actual result (31)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (5634) and verify the expected output (57) vs actual result (57)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (1111111111) and verify the expected output (71) vs actual result (71)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (987654321) and verify the expected output (30) vs actual result (30)","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"92cddf6ef1a2b768","name":"stdout","source":"92cddf6ef1a2b768.txt","type":"text/plain","size":318}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ThirtTestCase::0","time":{"start":1724735127953,"stop":1724735127953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"A Rule of Divisibility by 13"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.a_rule_of_divisibility_by_13.test_thirt"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/564057bc348c7200bd0000ff/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"772c9d6fdd465a8a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/777ba0c823c5a82a.json b/allure-report/data/test-cases/777ba0c823c5a82a.json new file mode 100644 index 00000000000..aa4fe53424e --- /dev/null +++ b/allure-report/data/test-cases/777ba0c823c5a82a.json @@ -0,0 +1 @@ +{"uid":"777ba0c823c5a82a","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1732428194170,"stop":1732428194170,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"PARSING"},{"name":"story","value":"Count IP Addresses"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"777ba0c823c5a82a.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/d820d165ec4b4b72.json b/allure-report/data/test-cases/77a9a3d99a741f47.json
similarity index 55%
rename from allure-report/data/test-cases/d820d165ec4b4b72.json
rename to allure-report/data/test-cases/77a9a3d99a741f47.json
index d80b31ab503..9142bbb2e1a 100644
--- a/allure-report/data/test-cases/d820d165ec4b4b72.json
+++ b/allure-report/data/test-cases/77a9a3d99a741f47.json
@@ -1 +1 @@
-{"uid":"d820d165ec4b4b72","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1732428195590,"stop":1732428195590,"duration":0},"description":"\n Testing potion function with various test inputs\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1732428195589,"stop":1732428195589,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing potion function with various test inputs\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1732428195590,"stop":1732428195590,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1732428195591,"stop":1732428195591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Potion Class 101"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Classes"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"47068bee5b06a234","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"95a29a9545c416cd","status":"passed","time":{"start":1724733474038,"stop":1724733474038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"cdfe495bc85470d2","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"7d1621a20d6f8fe7","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"d820d165ec4b4b72.json","parameterValues":[]} \ No newline at end of file +{"uid":"77a9a3d99a741f47","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1732428195590,"stop":1732428195590,"duration":0},"description":"\n Testing potion function with various test inputs\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1732428195589,"stop":1732428195589,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing potion function with various test inputs\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1732428195590,"stop":1732428195590,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1732428195591,"stop":1732428195591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Potion Class 101"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Classes"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"77a9a3d99a741f47.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/77ce7ba6af0b177a.json b/allure-report/data/test-cases/77ce7ba6af0b177a.json new file mode 100644 index 00000000000..7117bfa23fb --- /dev/null +++ b/allure-report/data/test-cases/77ce7ba6af0b177a.json @@ -0,0 +1 @@ +{"uid":"77ce7ba6af0b177a","name":"You are given two angles -> find the 3rd.","fullName":"kyu_8.third_angle_of_triangle.test_third_angle_of_triangle.OtherAngleTestCase#test_other_angle","historyId":"6630066bed88b9c8246478bc4b94ac73","time":{"start":1732764221276,"stop":1732764221276,"duration":0},"description":"\n You are given two angles (in degrees) of a triangle.\n Find the 3rd.\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Classes"},{"name":"story","value":"Potion Class 101"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"47068bee5b06a234.json","parameterValues":[]} \ No newline at end of file +{"uid":"79e5a850abe86297","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Classes"},{"name":"story","value":"Potion Class 101"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"79e5a850abe86297.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/332b728d7cfdedcf.json b/allure-report/data/test-cases/7b584cbfaa9e2f14.json similarity index 60% rename from allure-report/data/test-cases/332b728d7cfdedcf.json rename to allure-report/data/test-cases/7b584cbfaa9e2f14.json index f38026afdeb..9527094736a 100644 --- a/allure-report/data/test-cases/332b728d7cfdedcf.json +++ b/allure-report/data/test-cases/7b584cbfaa9e2f14.json @@ -1 +1 @@ -{"uid":"332b728d7cfdedcf","name":"Testing permute_a_palindrome (negative)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_negative","historyId":"7090b58c62fab362ad673c85c67765af","time":{"start":1724733474007,"stop":1724733474007,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1732764221316,"stop":1732764221316,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1732764221316,"stop":1732764221316,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1732764221316,"stop":1732764221316,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1732764221320,"stop":1732764221320,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"story","value":"Will you make it?"},{"name":"epic","value":"8 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9ece4d55c6bd3b35","status":"passed","time":{"start":1732428196453,"stop":1732428196455,"duration":2}},{"uid":"bdcd06f2ac6e82c9","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}},{"uid":"3b2be2c8b8f3d0bb","status":"passed","time":{"start":1724733474975,"stop":1724733474975,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"b2705032891531e8","status":"passed","time":{"start":1732428196453,"stop":1732428196455,"duration":2}},{"uid":"afae2f3faef55f2b","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}},{"uid":"627a7fd2fe38a284","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"7c6af0e0a129f035.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/518cb319be0d6f5c.json b/allure-report/data/test-cases/7d3b7c7449825e20.json similarity index 61% rename from allure-report/data/test-cases/518cb319be0d6f5c.json rename to allure-report/data/test-cases/7d3b7c7449825e20.json index d94d565e5e1..ae5b49a969e 100644 --- a/allure-report/data/test-cases/518cb319be0d6f5c.json +++ b/allure-report/data/test-cases/7d3b7c7449825e20.json @@ -1 +1 @@ -{"uid":"518cb319be0d6f5c","name":"Testing 'vaporcode' function","fullName":"kyu_7.vaporcode.test_vaporcode.VaporcodeTestCase#test_vaporcode","historyId":"91791ed1a852f76f936407ccb3d2dbaa","time":{"start":1724735129336,"stop":1724735129336,"duration":0},"description":"\n Testing 'vaporcode' function\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Remove items from the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"29aa0c598c1f2d04","name":"stdout","source":"29aa0c598c1f2d04.txt","type":"text/plain","size":254}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"7de68906bfa0f18.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7e066328cfed2428.json b/allure-report/data/test-cases/7e066328cfed2428.json new file mode 100644 index 00000000000..3f4050aa3c4 --- /dev/null +++ b/allure-report/data/test-cases/7e066328cfed2428.json @@ -0,0 +1 @@ +{"uid":"7e066328cfed2428","name":"Testing invite_more_women function (negative)","fullName":"kyu_7.simple_fun_152.test_invite_more_women.InviteMoreWomenTestCase#test_invite_more_women_negative","historyId":"439816a19ff5fc7179df296b3e238bad","time":{"start":1732764220670,"stop":1732764220670,"duration":0},"description":"\n Simple Fun #152: Invite More Women?\n Testing invite_more_women function (negative)\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1732428196232,"stop":1732428196232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Greek Sort"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a0d455d6bf21528b","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"c6f52d0b9e8ac3c5","status":"passed","time":{"start":1724733474725,"stop":1724733474725,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"327fbdea3443aca5","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"c301f45b01d7d10f","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"a4849e99633e4676.json","parameterValues":[]} \ No newline at end of file +{"uid":"7e0fbf3b4505484b","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1732428196230,"stop":1732428196230,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1732428196232,"stop":1732428196232,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Greek Sort"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"7e0fbf3b4505484b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7e357cecc68f801.json b/allure-report/data/test-cases/7e357cecc68f801.json deleted file mode 100644 index 1713cebdab0..00000000000 --- a/allure-report/data/test-cases/7e357cecc68f801.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"7e357cecc68f801","name":"Testing alphanumeric function","fullName":"kyu_5.not_very_secure.test_alphanumeric.AlphanumericTestCase#test_alphanumeric","historyId":"e4b3b27b629bbd5f25abab144f66de37","time":{"start":1724735127860,"stop":1724735127860,"duration":0},"description":"\n Testing alphanumeric function with\n various test inputs\n\n The string has the following conditions\n to be alphanumeric only\n\n 1. At least one character (\"\" is not valid)\n 2. Allowed characters are uppercase or lowercase\n latin letters and digits from 0 to 9\n 3. No whitespaces or underscore or special chars\n\n :return: None\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"d936198953d58b58.json","parameterValues":[]} \ No newline at end of file +{"uid":"7e36f3895c7e5ba3","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"7e36f3895c7e5ba3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7e997a5018ff0710.json b/allure-report/data/test-cases/7e997a5018ff0710.json deleted file mode 100644 index d63d84c602d..00000000000 --- a/allure-report/data/test-cases/7e997a5018ff0710.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"7e997a5018ff0710","name":"Testing 'longest_repetition' function","fullName":"kyu_6.longest_repetition.test_longest_repetition.LongestRepetitionTestCase#test_longest_repetition","historyId":"6431e0366c9c302e03ac01343fb7ea77","time":{"start":1732428195517,"stop":1732428195517,"duration":0},"description":"\n For a given string s find the character c (or C) with\n longest consecutive repetition and return: (c, l)\n where l (or L) is the length of the repetition.\n\n For empty string return: ('', 0)\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5e949b4a7c16c61","name":"stdout","source":"5e949b4a7c16c61.txt","type":"text/plain","size":640}],"parameters":[],"stepsCount":13,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724733473093,"stop":1724733473093,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Casino chips"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"7ec3425d5267a222.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/684d4d6fbb32213a.json b/allure-report/data/test-cases/7ed5e03fb846420f.json similarity index 64% rename from allure-report/data/test-cases/684d4d6fbb32213a.json rename to allure-report/data/test-cases/7ed5e03fb846420f.json index 583015da5e4..f05003e0332 100644 --- a/allure-report/data/test-cases/684d4d6fbb32213a.json +++ b/allure-report/data/test-cases/7ed5e03fb846420f.json @@ -1 +1 @@ -{"uid":"684d4d6fbb32213a","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"62d969149cac19e2","name":"stdout","source":"62d969149cac19e2.txt","type":"text/plain","size":167}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"684d4d6fbb32213a.json","parameterValues":[]} \ No newline at end of file +{"uid":"7ed5e03fb846420f","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"30e865fe73fa5b27","name":"stdout","source":"30e865fe73fa5b27.txt","type":"text/plain","size":167}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474163,"stop":1724733474163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"7ed5e03fb846420f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/98c161ccba9924bd.json b/allure-report/data/test-cases/7eedfccbd9267527.json similarity index 54% rename from allure-report/data/test-cases/98c161ccba9924bd.json rename to allure-report/data/test-cases/7eedfccbd9267527.json index 522f3b85237..ace99f4eb1a 100644 --- a/allure-report/data/test-cases/98c161ccba9924bd.json +++ b/allure-report/data/test-cases/7eedfccbd9267527.json @@ -1 +1 @@ -{"uid":"98c161ccba9924bd","name":"get_size function tests","fullName":"kyu_8.surface_area_and_volume_of_box.test_get_size.GetSizeTestCase#test_get_size","historyId":"ecc1f7419b2f77621f5c909f1d0df9a9","time":{"start":1732428196385,"stop":1732428196385,"duration":0},"description":"\n Testing get_size function with various inputs\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f27833c43953c1b1","name":"stdout","source":"f27833c43953c1b1.txt","type":"text/plain","size":253}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"1f14a6ccebe34b08.json","parameterValues":[]} \ No newline at end of file +{"uid":"7fb0d954404a7411","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"657871840dfd173c","name":"stdout","source":"657871840dfd173c.txt","type":"text/plain","size":253}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724735129446,"stop":1724735129446,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"feature","value":"Lists"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"7fb0d954404a7411.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/801881710b06074.json b/allure-report/data/test-cases/801881710b06074.json new file mode 100644 index 00000000000..656a2ddf503 --- /dev/null +++ b/allure-report/data/test-cases/801881710b06074.json @@ -0,0 +1 @@ +{"uid":"801881710b06074","name":"Testing 'is_isogram' function","fullName":"kyu_7.isograms.test_is_isogram.IsIsogramTestCase#test_is_isogram","historyId":"6b98c62ee1b1f8e766b65263444ad2e5","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string aba and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string moOse and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the result","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"420f806ee93872a1","name":"stdout","source":"420f806ee93872a1.txt","type":"text/plain","size":401}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724733474304,"stop":1724733474304,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Isograms"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"String"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"801881710b06074.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/80a5eacfa2431348.json b/allure-report/data/test-cases/80a5eacfa2431348.json new file mode 100644 index 00000000000..ba5d455facc --- /dev/null +++ b/allure-report/data/test-cases/80a5eacfa2431348.json @@ -0,0 +1 @@ +{"uid":"80a5eacfa2431348","name":"Testing easy_line function exception message","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_easy_line_exception","historyId":"97004dd24763a55cdf2b4ee4f115bd44","time":{"start":1732764220479,"stop":1732764220479,"duration":0},"description":"\n Testing easy line function exception\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy line function exception\n :return:\n ","descriptionHtml":"The function should raise exception for invalid n (n < 0) values.
","status":"passed","steps":[{"name":"Enter invalid n (-1) and assert exception message: ERROR: invalid n (-1) value. n must be >= 0).","time":{"start":1732764220479,"stop":1732764220479,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732764220480,"stop":1732764220480,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"7 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"13c5e35ef3c791a0","status":"passed","time":{"start":1732428195787,"stop":1732428195788,"duration":1}},{"uid":"44516baeffa03c9d","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"7e36f3895c7e5ba3","status":"passed","time":{"start":1724733474226,"stop":1724733474226,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"593778a5ba99d447","status":"passed","time":{"start":1732428195787,"stop":1732428195788,"duration":1}},{"uid":"df0c490941a6877a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}},{"uid":"c7106989a12e3c0a","status":"passed","time":{"start":1724735129071,"stop":1724735129071,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"80a5eacfa2431348.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b3c5df850665402e.json b/allure-report/data/test-cases/80ba443311cb72ff.json similarity index 67% rename from allure-report/data/test-cases/b3c5df850665402e.json rename to allure-report/data/test-cases/80ba443311cb72ff.json index 95f84332dc3..c133dc354c5 100644 --- a/allure-report/data/test-cases/b3c5df850665402e.json +++ b/allure-report/data/test-cases/80ba443311cb72ff.json @@ -1 +1 @@ -{"uid":"b3c5df850665402e","name":"goals function verification","fullName":"kyu_8.grasshopper_messi_goals_function.test_messi_goals_function.GoalsTestCase#test_goals","historyId":"7c1c8c6318c554c86b695deacecf1854","time":{"start":1724733474694,"stop":1724733474694,"duration":0},"description":"\n Verify that the function returns Messi's\n total number of goals in all three leagues.\n :return:\n ","descriptionHtml":" Testing using empty test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 108, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"880859ea02196db7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194194,"stop":1732428194194,"duration":0}},{"uid":"706d67120123862f","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"61f84f81177cf38b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"b5a113fbe50e74ce","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194194,"stop":1732428194194,"duration":0}},{"uid":"39245131d70863d6","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"c322e80c6cd8da83","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"80f314b70b306bd4.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/813aa9dc885c2882.json b/allure-report/data/test-cases/813aa9dc885c2882.json
deleted file mode 100644
index 518b2f33c0f..00000000000
--- a/allure-report/data/test-cases/813aa9dc885c2882.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"813aa9dc885c2882","name":"'multiply' function verification with random list","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest_random_list","historyId":"be99c6f72cdf623836966737dcb7a654","time":{"start":1724735129227,"stop":1724735129227,"duration":0},"description":"\n Returns a list that misses only one element\n :return:\n ","descriptionHtml":" Testing using medium test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 46, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2f520e29faf9fa03","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"4073719ea3c0e8fe","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"87acfa055dcbe26a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"a064a48d91c28f13","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"571176bf000b455b.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"8271119e6077f333","name":"test_solution_medium","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_medium","historyId":"7ee6731933bd9dff6fabc41830db1bf0","time":{"start":1732428194198,"stop":1732428194198,"duration":0},"description":"\n Testing using medium test data\n :return:\n ","descriptionHtml":" Testing using medium test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 46, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"8271119e6077f333.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/82a681e3f0c8f54d.json b/allure-report/data/test-cases/82a681e3f0c8f54d.json
deleted file mode 100644
index 33a5f4f91ef..00000000000
--- a/allure-report/data/test-cases/82a681e3f0c8f54d.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"82a681e3f0c8f54d","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1724735128836,"stop":1724735128852,"duration":16},"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a3af1182be2fa344","name":"stdout","source":"a3af1182be2fa344.txt","type":"text/plain","size":2621}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"82a681e3f0c8f54d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/82a8f1ffa445d40.json b/allure-report/data/test-cases/82a8f1ffa445d40.json deleted file mode 100644 index ef3f80534cb..00000000000 --- a/allure-report/data/test-cases/82a8f1ffa445d40.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"82a8f1ffa445d40","name":"AND logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_and","historyId":"49af4a8ebdc007fac4acbc085138b80e","time":{"start":1724733474804,"stop":1724733474804,"duration":0},"description":"\n And (∧) is the truth-functional\n operator of logical conjunction\n\n The and of a set of operands is true\n if and only if all of its operands are true.\n\n Source:\n https://en.wikipedia.org/wiki/Logical_conjunction\n\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cda2f56ac699fd36","name":"stdout","source":"cda2f56ac699fd36.txt","type":"text/plain","size":2817}],"parameters":[],"hasContent":true,"stepsCount":30,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724733472546,"stop":1724733472546,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"837e4ce24ac45efb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8388a8495a8b75af.json b/allure-report/data/test-cases/8388a8495a8b75af.json new file mode 100644 index 00000000000..4aa442d3df9 --- /dev/null +++ b/allure-report/data/test-cases/8388a8495a8b75af.json @@ -0,0 +1 @@ +{"uid":"8388a8495a8b75af","name":"'multiply' function verification with random list","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest_random_list","historyId":"be99c6f72cdf623836966737dcb7a654","time":{"start":1732764220641,"stop":1732764220642,"duration":1},"description":"\n Returns a list that misses only one element\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"4961a0c52d810ec1.json","parameterValues":[]} \ No newline at end of file +{"uid":"83b34d0610fd83c6","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_2","historyId":"72a2d75b45f09e520765f369cfc2bc8f","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"83b34d0610fd83c6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/83c423646ff2d9ba.json b/allure-report/data/test-cases/83c423646ff2d9ba.json deleted file mode 100644 index ab87df1afad..00000000000 --- a/allure-report/data/test-cases/83c423646ff2d9ba.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"83c423646ff2d9ba","name":"Testing valid_parentheses function","fullName":"kyu_5.valid_parentheses.test_valid_parentheses.ValidParenthesesTestCase#test_valid_parentheses","historyId":"92164414ad94bf1f5638230345fa606d","time":{"start":1724733473030,"stop":1724733473030,"duration":0},"description":"\n Test the function called that takes a string of parentheses,\n and determines if the order of the parentheses is valid.\n The function should return true if the string is valid,\n and false if it's invalid.\n\n Examples\n\n \"()\" => true\n \")(()))\" => false\n \"(\" => false\n \"(())((()())())\" => true\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1732428194123,"stop":1732428194123,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1732428194125,"stop":1732428194125,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1732428194125,"stop":1732428194125,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"AGGREGATIONS"},{"name":"feature","value":"Aggregations"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"39376204dc517df6","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}},{"uid":"ed566371d87065db","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"e03974f538ea8ee6","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}},{"uid":"acc95e26a53d92ff","status":"passed","time":{"start":1724735127391,"stop":1724735127391,"duration":0}}]},"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"9f9422c1f71252b6.json","parameterValues":[]} \ No newline at end of file +{"uid":"84ea3c3b3250393e","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1732428194124,"stop":1732428194125,"duration":1},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1732428194123,"stop":1732428194123,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1732428194124,"stop":1732428194124,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1732428194125,"stop":1732428194125,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1732428194125,"stop":1732428194125,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"AGGREGATIONS"},{"name":"feature","value":"Aggregations"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"84ea3c3b3250393e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/12f0442ef33f054e.json b/allure-report/data/test-cases/85613c3b6c6421c4.json similarity index 55% rename from allure-report/data/test-cases/12f0442ef33f054e.json rename to allure-report/data/test-cases/85613c3b6c6421c4.json index 0f9f7bd2dd9..66c49ce5da2 100644 --- a/allure-report/data/test-cases/12f0442ef33f054e.json +++ b/allure-report/data/test-cases/85613c3b6c6421c4.json @@ -1 +1 @@ -{"uid":"12f0442ef33f054e","name":"String with alphabet chars only","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_alpha_only","historyId":"f1e3ad74179a106b1d5dc35a6ffe21fa","time":{"start":1732428195473,"stop":1732428195473,"duration":0},"description":"\n Test string with alphabet chars only.\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5d5a8c5ce62738a7","name":"stdout","source":"5d5a8c5ce62738a7.txt","type":"text/plain","size":676}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LOOPS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"33fff97900a7d8bc.json","parameterValues":[]} \ No newline at end of file +{"uid":"86173a2048ae1d24","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"fba7e6f7e7538915","name":"stdout","source":"fba7e6f7e7538915.txt","type":"text/plain","size":676}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724735127469,"stop":1724735127469,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LOOPS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"86173a2048ae1d24.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/be628f1c5b8245e1.json b/allure-report/data/test-cases/861fc17326f7d16a.json similarity index 71% rename from allure-report/data/test-cases/be628f1c5b8245e1.json rename to allure-report/data/test-cases/861fc17326f7d16a.json index f5110870b61..cc4d487957d 100644 --- a/allure-report/data/test-cases/be628f1c5b8245e1.json +++ b/allure-report/data/test-cases/861fc17326f7d16a.json @@ -1 +1 @@ -{"uid":"be628f1c5b8245e1","name":"Testing check_for_factor function: positive flow","fullName":"kyu_8.grasshopper_check_for_factor.test_check_for_factor.CheckForFactorTestCase#test_check_for_factor_false","historyId":"8c287dae332df512fc4a9755020ffedc","time":{"start":1724733474679,"stop":1724733474694,"duration":15},"description":"\n Testing check_for_factor function.\n\n This function should test if the\n factor is a factor of base.\n\n Return false if it is not a factor.\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Append the list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4143349f87c576ac","name":"stdout","source":"4143349f87c576ac.txt","type":"text/plain","size":261}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"c5ea93b10613ec53.json","parameterValues":[]} \ No newline at end of file +{"uid":"86447fe348b226fe","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Append the list","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a21b9ca1dd2e7b86","name":"stdout","source":"a21b9ca1dd2e7b86.txt","type":"text/plain","size":261}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"86447fe348b226fe.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c7e963fd1c95dafe.json b/allure-report/data/test-cases/864737f712b002ec.json similarity index 56% rename from allure-report/data/test-cases/c7e963fd1c95dafe.json rename to allure-report/data/test-cases/864737f712b002ec.json index 8d7b5957f67..9f457309c14 100644 --- a/allure-report/data/test-cases/c7e963fd1c95dafe.json +++ b/allure-report/data/test-cases/864737f712b002ec.json @@ -1 +1 @@ -{"uid":"c7e963fd1c95dafe","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1732428196100,"stop":1732428196101,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1732428196102,"stop":1732428196102,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"3d4f8cb2de087cf","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}},{"uid":"d58adc2ec0d31961","status":"passed","time":{"start":1724733474569,"stop":1724733474569,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d3037fd25424c6f3","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}},{"uid":"1d2c6842ef40288f","status":"passed","time":{"start":1724735129383,"stop":1724735129383,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"c7e963fd1c95dafe.json","parameterValues":[]} \ No newline at end of file +{"uid":"864737f712b002ec","name":"Testing century function","fullName":"kyu_8.century_from_year.test_century.CenturyTestCase#test_century","historyId":"079ace8555debd1c87111e8c5a6664bf","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase","time":{"start":1732428196100,"stop":1732428196101,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing century function\n ","descriptionHtml":"Given a year, the function should return the century it is in.
","status":"passed","steps":[{"name":"Enter test year (1705) and verify the output (18) vs expected (18)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1900) and verify the output (19) vs expected (19)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (1601) and verify the output (17) vs expected (17)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (2000) and verify the output (20) vs expected (20)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (356) and verify the output (4) vs expected (4)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test year (89) and verify the output (1) vs expected (1)","time":{"start":1732428196101,"stop":1732428196101,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CenturyTestCase::0","time":{"start":1732428196102,"stop":1732428196102,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"suite","value":"Numbers"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Century From Year"},{"name":"tag","value":"DATES/TIME"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.century_from_year.test_century"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a3fe3dde1ce0e8ed6000097","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","DATES/TIME","BASIC LANGUAGE FEATURES","ALGORITHMS"]},"source":"864737f712b002ec.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8672ab2817945b36.json b/allure-report/data/test-cases/8672ab2817945b36.json new file mode 100644 index 00000000000..75ec87efca4 --- /dev/null +++ b/allure-report/data/test-cases/8672ab2817945b36.json @@ -0,0 +1 @@ +{"uid":"8672ab2817945b36","name":"Testing string_to_array function","fullName":"kyu_8.convert_string_to_an_array.test_string_to_array.StringToArrayTestCase#test_string_to_array","historyId":"f51ecfb2c4460f518b2155a78436a09d","time":{"start":1732764220862,"stop":1732764220862,"duration":0},"description":"\n Testing string_to_array function.\n\n A function to split a string and\n convert it into an array of words.\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Append the list","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9c43e0c7813423da","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}},{"uid":"c5ea93b10613ec53","status":"passed","time":{"start":1724733473139,"stop":1724733473139,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"b5a45493f51c1d67","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}},{"uid":"7f890ca68cdfc481","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"2655a1e6934b1850.json","parameterValues":[]} \ No newline at end of file +{"uid":"875e90b046ec092c","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Append the list","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"875e90b046ec092c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/48ff8cbb530a1868.json b/allure-report/data/test-cases/8782c11be4532248.json similarity index 73% rename from allure-report/data/test-cases/48ff8cbb530a1868.json rename to allure-report/data/test-cases/8782c11be4532248.json index 3c7f7e67dfe..b850ce7c954 100644 --- a/allure-report/data/test-cases/48ff8cbb530a1868.json +++ b/allure-report/data/test-cases/8782c11be4532248.json @@ -1 +1 @@ -{"uid":"48ff8cbb530a1868","name":"Testing two_decimal_places function","fullName":"kyu_7.formatting_decimal_places_1.test_two_decimal_places.TwoDecimalPlacesTestCase#test_two_decimal_places","historyId":"27ae718be00b2e9f316c37c338cb2894","time":{"start":1724733474257,"stop":1724733474257,"duration":0},"description":"\n Testing two_decimal_places function\n with various test inputs\n\n Each floating-point number should be\n formatted that only the first two\n decimal places are returned.\n\n You don't need to check whether the input\n is a valid number because only valid numbers\n are used in the tests.\n\n Don't round the numbers! Just cut them\n after two decimal places!\n\n :return:\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1732428193949,"stop":1732428193949,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732428193950,"stop":1732428193950,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1732428193951,"stop":1732428193951,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CIPHERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"SECURITY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"bce82edab468d2f2","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"27b26e7a6523571a","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d9a6d590487a20fd","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"7e0e76f32ac7ce4e","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"8804093a9c3b17d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b5a113fbe50e74ce.json b/allure-report/data/test-cases/880859ea02196db7.json similarity index 56% rename from allure-report/data/test-cases/b5a113fbe50e74ce.json rename to allure-report/data/test-cases/880859ea02196db7.json index 030444d5fbf..63f4f77f5ac 100644 --- a/allure-report/data/test-cases/b5a113fbe50e74ce.json +++ b/allure-report/data/test-cases/880859ea02196db7.json @@ -1 +1 @@ -{"uid":"b5a113fbe50e74ce","name":"test_solution_empty","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_empty","historyId":"29249ea89f0081dda70899f3290f857b","time":{"start":1732428194194,"stop":1732428194194,"duration":0},"description":"\n Testing using empty test data\n :return:\n ","descriptionHtml":" Testing using empty test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 108, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7131237025069abe","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"37f24af32c057862","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"39245131d70863d6","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"c322e80c6cd8da83","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"b5a113fbe50e74ce.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"880859ea02196db7","name":"test_solution_empty","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_empty","historyId":"29249ea89f0081dda70899f3290f857b","time":{"start":1732428194194,"stop":1732428194194,"duration":0},"description":"\n Testing using empty test data\n :return:\n ","descriptionHtml":" Testing using empty test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 108, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"880859ea02196db7.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/cda9164d86dd0b79.json b/allure-report/data/test-cases/8817b6c726fc2884.json
similarity index 64%
rename from allure-report/data/test-cases/cda9164d86dd0b79.json
rename to allure-report/data/test-cases/8817b6c726fc2884.json
index 64c97754ef6..4c1216a717a 100644
--- a/allure-report/data/test-cases/cda9164d86dd0b79.json
+++ b/allure-report/data/test-cases/8817b6c726fc2884.json
@@ -1 +1 @@
-{"uid":"cda9164d86dd0b79","name":"Non consecutive number should be returned","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_positive","historyId":"13df60cbdff5ee076adcd6328cc69159","time":{"start":1724733474663,"stop":1724733474663,"duration":0},"description":"\n If we have an array [1,2,3,4,6,7,8] then 1 then 2\n then 3 then 4 are all consecutive but 6 is not,\n so that's the first non-consecutive number.\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Insert items to the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3f23fd2a44d74bcb","name":"stdout","source":"3f23fd2a44d74bcb.txt","type":"text/plain","size":261}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"9f02852e3aa10b6d.json","parameterValues":[]} \ No newline at end of file +{"uid":"88ed1c9da2d9b53b","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Insert items to the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9e573d2ead28469f","name":"stdout","source":"9e573d2ead28469f.txt","type":"text/plain","size":261}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"88ed1c9da2d9b53b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/25a09c2c9e3c88b1.json b/allure-report/data/test-cases/893f14f04872e4c5.json similarity index 63% rename from allure-report/data/test-cases/25a09c2c9e3c88b1.json rename to allure-report/data/test-cases/893f14f04872e4c5.json index b67e6e1af00..80b8d41f4d9 100644 --- a/allure-report/data/test-cases/25a09c2c9e3c88b1.json +++ b/allure-report/data/test-cases/893f14f04872e4c5.json @@ -1 +1 @@ -{"uid":"25a09c2c9e3c88b1","name":"Testing 'letter_count' function","fullName":"kyu_6.count_letters_in_string.test_count_letters_in_string.CountLettersInStringTestCase#test_count_letters_in_string","historyId":"04bb543ec741bd163e341a33a1623692","time":{"start":1724735128016,"stop":1724735128016,"duration":0},"description":"\n Testing 'letter_count' function\n :return:\n ","descriptionHtml":"Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724735129774,"stop":1724735129774,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8ef3c2609186193","name":"stdout","source":"8ef3c2609186193.txt","type":"text/plain","size":23}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724735129789,"stop":1724735129789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"No kyu helper methods"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"8beabd2469a668.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3fd800b8d3602698.json b/allure-report/data/test-cases/8bf0e4ddc17f51c8.json similarity index 74% rename from allure-report/data/test-cases/3fd800b8d3602698.json rename to allure-report/data/test-cases/8bf0e4ddc17f51c8.json index 1e368ea2f44..136ec9c9064 100644 --- a/allure-report/data/test-cases/3fd800b8d3602698.json +++ b/allure-report/data/test-cases/8bf0e4ddc17f51c8.json @@ -1 +1 @@ -{"uid":"3fd800b8d3602698","name":"Testing all_fibonacci_numbers function","fullName":"kyu_5.fibonacci_streaming.test_all_fibonacci_numbers.AllFibonacciNumbersTestCase#test_all_fibonacci_numbers","historyId":"a7b5f0a3a7cd2fe8faed75e5c4a52138","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing all_fibonacci_numbers function\n\n You're going to provide a needy programmer a\n utility method that generates an infinite sized,\n sequential IntStream (in Python generator)\n which contains all the numbers in a fibonacci\n sequence.\n\n A fibonacci sequence starts with two 1s.\n Every element afterwards is the sum of\n the two previous elements.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c520dd2a3bb6ed30","name":"stdout","source":"c520dd2a3bb6ed30.txt","type":"text/plain","size":639}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Aggregations"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"ed566371d87065db.json","parameterValues":[]} \ No newline at end of file +{"uid":"8c4c3ac3b9ddced3","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"662510f84e87d061","name":"stdout","source":"662510f84e87d061.txt","type":"text/plain","size":639}],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Sum of Intervals"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Aggregations"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"8c4c3ac3b9ddced3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8d85f39401914c16.json b/allure-report/data/test-cases/8d85f39401914c16.json new file mode 100644 index 00000000000..2a6c186aa82 --- /dev/null +++ b/allure-report/data/test-cases/8d85f39401914c16.json @@ -0,0 +1 @@ +{"uid":"8d85f39401914c16","name":"Testing easy_diagonal function","fullName":"kyu_6.easy_diagonal.test_diagonal.EasyDiagonalTestCase#test_easy_diagonal","historyId":"5d9c9166bf610b28a284723b5b23aab1","time":{"start":1724735128094,"stop":1724735128742,"duration":648},"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d1599295a3f41ee0","name":"stdout","source":"d1599295a3f41ee0.txt","type":"text/plain","size":524}],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Diagonal"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"8d85f39401914c16.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/827104e07f2ca2d0.json b/allure-report/data/test-cases/8dcdfa9166c48fb8.json similarity index 71% rename from allure-report/data/test-cases/827104e07f2ca2d0.json rename to allure-report/data/test-cases/8dcdfa9166c48fb8.json index 46925444f77..35528fee1f9 100644 --- a/allure-report/data/test-cases/827104e07f2ca2d0.json +++ b/allure-report/data/test-cases/8dcdfa9166c48fb8.json @@ -1 +1 @@ -{"uid":"827104e07f2ca2d0","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"25583e198df733bf","name":"stdout","source":"25583e198df733bf.txt","type":"text/plain","size":434}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"827104e07f2ca2d0.json","parameterValues":[]} \ No newline at end of file +{"uid":"8dcdfa9166c48fb8","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"20e82e5aa37702bc","name":"stdout","source":"20e82e5aa37702bc.txt","type":"text/plain","size":434}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"8dcdfa9166c48fb8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8dfef1ba8856d412.json b/allure-report/data/test-cases/8dfef1ba8856d412.json new file mode 100644 index 00000000000..66e7384ff8e --- /dev/null +++ b/allure-report/data/test-cases/8dfef1ba8856d412.json @@ -0,0 +1 @@ +{"uid":"8dfef1ba8856d412","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1732764221040,"stop":1732764221041,"duration":1},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732764221024,"stop":1732764221024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732764221040,"stop":1732764221041,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732764221042,"stop":1732764221042,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Math"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"42358797bb03e774","status":"passed","time":{"start":1732428196249,"stop":1732428196250,"duration":1}},{"uid":"30e62f45ee93d21d","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}},{"uid":"b3ade822e686b250","status":"passed","time":{"start":1724733474757,"stop":1724733474757,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"b67813f1cae4659e","status":"passed","time":{"start":1732428196249,"stop":1732428196250,"duration":1}},{"uid":"cde5d1b46b10d7ac","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}},{"uid":"f5a3f0d4d035c3a4","status":"passed","time":{"start":1724735129539,"stop":1724735129539,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"8dfef1ba8856d412.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8e1e8d12e75298b.json b/allure-report/data/test-cases/8e1e8d12e75298b.json deleted file mode 100644 index 52b2ad594ca..00000000000 --- a/allure-report/data/test-cases/8e1e8d12e75298b.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"8e1e8d12e75298b","name":"get_size function tests","fullName":"kyu_8.surface_area_and_volume_of_box.test_get_size.GetSizeTestCase#test_get_size","historyId":"ecc1f7419b2f77621f5c909f1d0df9a9","time":{"start":1724735129664,"stop":1724735129664,"duration":0},"description":"\n Testing get_size function with various inputs\n :return:\n ","descriptionHtml":" Testing using medium test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 46, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"8271119e6077f333","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194198,"stop":1732428194198,"duration":0}},{"uid":"634b88b34b81a74c","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"ac390c8ac17d8363","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"571176bf000b455b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194198,"stop":1732428194198,"duration":0}},{"uid":"87acfa055dcbe26a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"a064a48d91c28f13","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"8e9b4227c17ce17f.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/8ea6e5a2b5515469.json b/allure-report/data/test-cases/8ea6e5a2b5515469.json
deleted file mode 100644
index 8cd6caa097c..00000000000
--- a/allure-report/data/test-cases/8ea6e5a2b5515469.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"8ea6e5a2b5515469","name":"'multiply' function verification with random list","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest_random_list","historyId":"be99c6f72cdf623836966737dcb7a654","time":{"start":1732428195937,"stop":1732428195939,"duration":2},"description":"\n Returns a list that misses only one element\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"518d45d1073ca74","name":"stdout","source":"518d45d1073ca74.txt","type":"text/plain","size":263}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"90d2f619b6b55a93.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9164bf2c06bf8752.json b/allure-report/data/test-cases/9164bf2c06bf8752.json new file mode 100644 index 00000000000..a26f2fd9601 --- /dev/null +++ b/allure-report/data/test-cases/9164bf2c06bf8752.json @@ -0,0 +1 @@ +{"uid":"9164bf2c06bf8752","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1732764218915,"stop":1732764218915,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\").\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests").\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"Lists"},{"name":"story","value":"Find the smallest"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"998a460e800cbb2b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194259,"stop":1732428194259,"duration":0}},{"uid":"767acc864b347295","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}},{"uid":"5364b62b05552f1e","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472765,"stop":1724733472765,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"c58cb7ae6e5a9993","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194259,"stop":1732428194259,"duration":0}},{"uid":"c37dfc82a096ec09","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}},{"uid":"257a5ad111bd69a7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}}]},"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"9164bf2c06bf8752.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/91aab0544068789.json b/allure-report/data/test-cases/91aab0544068789.json
new file mode 100644
index 00000000000..86e0c9373fe
--- /dev/null
+++ b/allure-report/data/test-cases/91aab0544068789.json
@@ -0,0 +1 @@
+{"uid":"91aab0544068789","name":"goals function verification","fullName":"kyu_8.grasshopper_messi_goals_function.test_messi_goals_function.GoalsTestCase#test_goals","historyId":"7c1c8c6318c554c86b695deacecf1854","time":{"start":1724735129492,"stop":1724735129492,"duration":0},"description":"\n Verify that the function returns Messi's\n total number of goals in all three leagues.\n :return:\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"f1d39787f3312e8b.json","parameterValues":[]} \ No newline at end of file +{"uid":"921715088233c4e7","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1724733472515,"stop":1724733472515,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"921715088233c4e7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9246dbe4ecdc42ce.json b/allure-report/data/test-cases/9246dbe4ecdc42ce.json new file mode 100644 index 00000000000..aa8a0cd5f76 --- /dev/null +++ b/allure-report/data/test-cases/9246dbe4ecdc42ce.json @@ -0,0 +1 @@ +{"uid":"9246dbe4ecdc42ce","name":"Testing two_decimal_places function","fullName":"kyu_7.formatting_decimal_places_1.test_two_decimal_places.TwoDecimalPlacesTestCase#test_two_decimal_places","historyId":"27ae718be00b2e9f316c37c338cb2894","time":{"start":1732764220516,"stop":1732764220516,"duration":0},"description":"\n Testing two_decimal_places function\n with various test inputs\n\n Each floating-point number should be\n formatted that only the first two\n decimal places are returned.\n\n You don't need to check whether the input\n is a valid number because only valid numbers\n are used in the tests.\n\n Don't round the numbers! Just cut them\n after two decimal places!\n\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"PARSING"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"777ba0c823c5a82a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194170,"stop":1732428194170,"duration":0}},{"uid":"f9778b72019f6060","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"624b364c1e1f6bc7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"e5b1f301926fe23","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194170,"stop":1732428194170,"duration":0}},{"uid":"1dee8c06fd165199","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"e5ac2209dd79eabb","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"93b00a3d2e7b92c1.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/1506cf302ecd21f1.json b/allure-report/data/test-cases/93cbb9687a6c19d2.json
similarity index 61%
rename from allure-report/data/test-cases/1506cf302ecd21f1.json
rename to allure-report/data/test-cases/93cbb9687a6c19d2.json
index 22b344e7f9b..054c282dc20 100644
--- a/allure-report/data/test-cases/1506cf302ecd21f1.json
+++ b/allure-report/data/test-cases/93cbb9687a6c19d2.json
@@ -1 +1 @@
-{"uid":"1506cf302ecd21f1","name":"Testing period_is_late function (negative)","fullName":"kyu_8.is_your_period_late.test_is_your_period_late.PeriodIsLateTestCase#test_period_is_late_negative","historyId":"3ade0b8dc3a70452a99ea470cea361ac","time":{"start":1724735129555,"stop":1724735129555,"duration":0},"description":"\n Negative tests\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1732428194215,"stop":1732428194215,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1732428194217,"stop":1732428194217,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"feature","value":"String"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"90d2f619b6b55a93","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}},{"uid":"eaaef6c05ba4cb98","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"627da61e5891aa44","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}},{"uid":"d8e9539521c4ca00","status":"passed","time":{"start":1724735127500,"stop":1724735127500,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"2b89947e3a3ec46d.json","parameterValues":[]} \ No newline at end of file +{"uid":"950acbfbefb81796","name":"Testing domain_name function","fullName":"kyu_5.extract_the_domain_name_from_url.test_domain_name.DomainNameTestCase#test_domain_name","historyId":"cd64b52319d4c70d68e281e8561ab97f","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1732428194215,"stop":1732428194215,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1732428194216,"stop":1732428194216,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1732428194217,"stop":1732428194217,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"feature","value":"String"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"950acbfbefb81796.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/67f932ff555edbd0.json b/allure-report/data/test-cases/95924b9d92f1ced5.json similarity index 69% rename from allure-report/data/test-cases/67f932ff555edbd0.json rename to allure-report/data/test-cases/95924b9d92f1ced5.json index 03fb0450b9f..99f4d419ebf 100644 --- a/allure-report/data/test-cases/67f932ff555edbd0.json +++ b/allure-report/data/test-cases/95924b9d92f1ced5.json @@ -1 +1 @@ -{"uid":"67f932ff555edbd0","name":"String alphabet chars and spaces","fullName":"kyu_6.first_character_that_repeats.test_first_character_that_repeats.FirstDupTestCase#test_first_space","historyId":"11acd8f3802b43ce2264b83840d495b4","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"description":"\n Repeating char is a space\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196244,"stop":1732428196244,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6d7f7d9659ba7dd5","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"4961a0c52d810ec1","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"26cf86ca9eda4b5","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"34febd97f08d8df7","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"371c743cf6f64f1d.json","parameterValues":[]} \ No newline at end of file +{"uid":"95e685797940e119","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_2","historyId":"72a2d75b45f09e520765f369cfc2bc8f","time":{"start":1732428196244,"stop":1732428196245,"duration":1},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196244,"stop":1732428196244,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"95e685797940e119.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5187a55d5b7bcbbd.json b/allure-report/data/test-cases/95e7a9865f127b46.json similarity index 80% rename from allure-report/data/test-cases/5187a55d5b7bcbbd.json rename to allure-report/data/test-cases/95e7a9865f127b46.json index 56258d38662..9f7c999a548 100644 --- a/allure-report/data/test-cases/5187a55d5b7bcbbd.json +++ b/allure-report/data/test-cases/95e7a9865f127b46.json @@ -1 +1 @@ -{"uid":"5187a55d5b7bcbbd","name":"Testing 'has_subpattern' (part 3) function","fullName":"kyu_6.string_subpattern_recognition_3.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"89f53112353ba49dc8f3a4029d39ba34","time":{"start":1724733474101,"stop":1724733474101,"duration":0},"description":"\n Verify that 'has_subpattern' function\n\n Return a subpattern with sorted characters,\n otherwise return the base string with sorted\n characters (you might consider this case as\n an edge case, with the subpattern being repeated\n only once and thus equalling the original input string).\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2862210bad838236","name":"stdout","source":"2862210bad838236.txt","type":"text/plain","size":544}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNCTIONS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Games"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","GAMES","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"2b5bdabfec79d6cf.json","parameterValues":[]} \ No newline at end of file +{"uid":"962ca80dcc908350","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7899fdb7c4350c2b","name":"stdout","source":"7899fdb7c4350c2b.txt","type":"text/plain","size":544}],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724735128883,"stop":1724735128883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNCTIONS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Games"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","GAMES","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"962ca80dcc908350.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/965bac5a2c55f031.json b/allure-report/data/test-cases/965bac5a2c55f031.json new file mode 100644 index 00000000000..84a29492243 --- /dev/null +++ b/allure-report/data/test-cases/965bac5a2c55f031.json @@ -0,0 +1 @@ +{"uid":"965bac5a2c55f031","name":"goals function verification","fullName":"kyu_8.grasshopper_messi_goals_function.test_messi_goals_function.GoalsTestCase#test_goals","historyId":"7c1c8c6318c554c86b695deacecf1854","time":{"start":1732764220989,"stop":1732764220989,"duration":0},"description":"\n Verify that the function returns Messi's\n total number of goals in all three leagues.\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
Test a function that take as parameter a list ls and return a list of the sums of its parts as defined below:
ls = [1, 2, 3, 4, 5, 6]
parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]
Test a function that take as parameter a list ls and return a list of the sums of its parts as defined below:
ls = [1, 2, 3, 4, 5, 6]
parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]
Test a function that take as parameter a list ls and return a list of the sums of its parts as defined below:
ls = [1, 2, 3, 4, 5, 6]
parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]
Test a function that take as parameter a list ls and return a list of the sums of its parts as defined below:
ls = [1, 2, 3, 4, 5, 6]
parts_sums(ls) -> [21, 20, 18, 15, 11, 6, 0]
Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"8efea6185ce9f545.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"96ce14353b4f3e49","name":"test_line_negative","fullName":"kyu_3.line_safari_is_that_a_line.test_line_negative.LineNegativeTestCase#test_line_negative","historyId":"e5c7abe0fcf3b79049d906f50808feb6","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Line Safari functionality\n Negative test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"96ce14353b4f3e49.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/92a7ecb29f4704b1.json b/allure-report/data/test-cases/97a2a77f06d4866c.json
similarity index 54%
rename from allure-report/data/test-cases/92a7ecb29f4704b1.json
rename to allure-report/data/test-cases/97a2a77f06d4866c.json
index a6b647d51eb..4271e6520ba 100644
--- a/allure-report/data/test-cases/92a7ecb29f4704b1.json
+++ b/allure-report/data/test-cases/97a2a77f06d4866c.json
@@ -1 +1 @@
-{"uid":"92a7ecb29f4704b1","name":"Test that no_space function removes the spaces","fullName":"kyu_8.remove_string_spaces.test_remove_string_spaces.NoSpaceTestCase#test_something","historyId":"8069a1b5a4342457d2dabf5819382a2e","time":{"start":1732428196352,"stop":1732428196352,"duration":0},"description":"\n Test that no_space function removes the spaces\n from the string, then return the resultant string.\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1732764220704,"stop":1732764220704,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1732764220704,"stop":1732764220704,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1732764220704,"stop":1732764220704,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1732764220704,"stop":1732764220704,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1732764220704,"stop":1732764220704,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1732764220704,"stop":1732764220704,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1732764220706,"stop":1732764220706,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sum of odd numbers"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARITHMETIC"},{"name":"feature","value":"Math"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e2ed60d0ac53c788","status":"passed","time":{"start":1732428195990,"stop":1732428195990,"duration":0}},{"uid":"583a0190aa99ad42","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}},{"uid":"cb7d8edff0d47cc5","status":"passed","time":{"start":1724733474460,"stop":1724733474460,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"419686fbcf063822","status":"passed","time":{"start":1732428195990,"stop":1732428195990,"duration":0}},{"uid":"9a325845218dd6ae","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}},{"uid":"d837297408a13c1e","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"980af150a499b4e9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/85284c487c263073.json b/allure-report/data/test-cases/98366b42396826ce.json similarity index 67% rename from allure-report/data/test-cases/85284c487c263073.json rename to allure-report/data/test-cases/98366b42396826ce.json index 0427bb4631f..fbafda8af97 100644 --- a/allure-report/data/test-cases/85284c487c263073.json +++ b/allure-report/data/test-cases/98366b42396826ce.json @@ -1 +1 @@ -{"uid":"85284c487c263073","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"554fb31ae5f3473b","name":"stdout","source":"554fb31ae5f3473b.txt","type":"text/plain","size":544}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"suite","value":"Games"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"CONTROL FLOW"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"85284c487c263073.json","parameterValues":[]} \ No newline at end of file +{"uid":"98366b42396826ce","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"157d07999fe8bb77","name":"stdout","source":"157d07999fe8bb77.txt","type":"text/plain","size":544}],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"suite","value":"Games"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"CONTROL FLOW"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAMES"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"98366b42396826ce.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/98ca489a74667507.json b/allure-report/data/test-cases/98ca489a74667507.json new file mode 100644 index 00000000000..aa3e1be7883 --- /dev/null +++ b/allure-report/data/test-cases/98ca489a74667507.json @@ -0,0 +1 @@ +{"uid":"98ca489a74667507","name":"Testing Decoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding.DecodingTestCase#test_decoding","historyId":"4ffbfcd08c63c75577964e4b263564bd","time":{"start":1732764218591,"stop":1732764218591,"duration":0},"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase","time":{"start":1732764218591,"stop":1732764218591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Decoding functionality\n ","descriptionHtml":"Verify cipher function. This \"decode\" is used to decode a string.
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218591,"stop":1732764218591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218591,"stop":1732764218591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218591,"stop":1732764218591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218591,"stop":1732764218591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1732764218591,"stop":1732764218591,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DecodingTestCase::0","time":{"start":1732764218594,"stop":1732764218594,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"SECURITY"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CIPHERS"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_decoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"532d8f53f92733e9","status":"passed","time":{"start":1732428193949,"stop":1732428193951,"duration":2}},{"uid":"58a164b572fc5a50","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"25b0f3d782a2ed03","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"8804093a9c3b17d","status":"passed","time":{"start":1732428193949,"stop":1732428193951,"duration":2}},{"uid":"d9a6d590487a20fd","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}},{"uid":"7e0e76f32ac7ce4e","status":"passed","time":{"start":1724735127203,"stop":1724735127203,"duration":0}}]},"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"98ca489a74667507.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/98e0aca6e090522b.json b/allure-report/data/test-cases/98e0aca6e090522b.json new file mode 100644 index 00000000000..a94575197c0 --- /dev/null +++ b/allure-report/data/test-cases/98e0aca6e090522b.json @@ -0,0 +1 @@ +{"uid":"98e0aca6e090522b","name":"Large lists","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_large_list","historyId":"3b3f116ec3ac1abf551a51811b4a8900","time":{"start":1732764220933,"stop":1732764220933,"duration":0},"description":"\n Large lists\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c0c4047155365dbf","name":"stdout","source":"c0c4047155365dbf.txt","type":"text/plain","size":46002}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"58e0261647deccd2.json","parameterValues":[]} \ No newline at end of file +{"uid":"994a4ad6b5f0c1e0","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127531,"stop":1724735127656,"duration":125},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4b1abe2714e07e88","name":"stdout","source":"4b1abe2714e07e88.txt","type":"text/plain","size":46002}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"994a4ad6b5f0c1e0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c58cb7ae6e5a9993.json b/allure-report/data/test-cases/998a460e800cbb2b.json similarity index 60% rename from allure-report/data/test-cases/c58cb7ae6e5a9993.json rename to allure-report/data/test-cases/998a460e800cbb2b.json index 1c4850ea128..c6391682a19 100644 --- a/allure-report/data/test-cases/c58cb7ae6e5a9993.json +++ b/allure-report/data/test-cases/998a460e800cbb2b.json @@ -1 +1 @@ -{"uid":"c58cb7ae6e5a9993","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1732428194259,"stop":1732428194259,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\").\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests").\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2b5d1a28c2e7859f","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}},{"uid":"3c944fe792fcd179","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472765,"stop":1724733472765,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"c37dfc82a096ec09","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}},{"uid":"257a5ad111bd69a7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127656,"stop":1724735127656,"duration":0}}]},"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c58cb7ae6e5a9993.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"998a460e800cbb2b","name":"test_smallest","fullName":"kyu_5.find_the_smallest.test_smallest.FindSmallestTestCase#test_smallest","historyId":"cb77631a44bdd00f9fa7fbe845b21048","time":{"start":1732428194259,"stop":1732428194259,"duration":0},"description":"\n Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see \"Sample Tests\").\n :return:\n ","descriptionHtml":" Test a function `smallest` which will return an array or a tuple or a string\n depending on the language (see "Sample Tests").\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\find_the_smallest\\\\test_smallest.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Find the smallest"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_smallest.test_smallest"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/573992c724fc289553000e95","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"998a460e800cbb2b.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/39376204dc517df6.json b/allure-report/data/test-cases/99a774ce5ee6bba3.json
similarity index 73%
rename from allure-report/data/test-cases/39376204dc517df6.json
rename to allure-report/data/test-cases/99a774ce5ee6bba3.json
index 2c7b0370170..1228f95e1ce 100644
--- a/allure-report/data/test-cases/39376204dc517df6.json
+++ b/allure-report/data/test-cases/99a774ce5ee6bba3.json
@@ -1 +1 @@
-{"uid":"39376204dc517df6","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8d52b389398fe1ce","name":"stdout","source":"8d52b389398fe1ce.txt","type":"text/plain","size":639}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"INTEGERS"},{"name":"feature","value":"Aggregations"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"story","value":"Sum of Intervals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"39376204dc517df6.json","parameterValues":[]} \ No newline at end of file +{"uid":"99a774ce5ee6bba3","name":"Testing sum_of_intervals function","fullName":"kyu_4.sum_of_intervals.test_sum_of_intervals.SumOfIntervalsTestCase#test_sum_of_intervals","historyId":"31852768c071e158fda7de0b172143f4","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_of_intervals function\n\n The function should accept an array of intervals,\n and return the sum of all the interval lengths.\n\n Overlapping intervals should only be counted once.\n\n Intervals\n Intervals are represented by a pair of integers in\n the form of an array. The first value of the interval\n will always be less than the second value.\n Interval example: [1, 5] is an interval from 1 to 5.\n The length of this interval is 4.\n :return:\n ","descriptionHtml":"Testing sum_of_intervals function
The function should accept an array of intervals, and return the sum of all the interval lengths.
Overlapping intervals should only be counted once.
Intervals
Intervals are represented by a pair of integers in the form of an array. The first value of the interval will always be less than the second value. Interval example: [1, 5] is an interval from 1 to 5. The length of this interval is 4.
","status":"passed","steps":[{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5), (6, 10)]), calculate the result (8) and compare vs expected (8)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(1, 5)]), calculate the result (4) and compare vs expected (4)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(7, 10), (1, 5)]), calculate the result (7) and compare vs expected (7)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(476, 493), (-484, 428)]), calculate the result (929) and compare vs expected (929)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-473, 476)]), calculate the result (949) and compare vs expected (949)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-419, 500)]), calculate the result (919) and compare vs expected (919)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(-153, 312), (360, 469)]), calculate the result (574) and compare vs expected (574)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list of intervals ([(456, 494), (-500, 436)]), calculate the result (974) and compare vs expected (974)","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"72e5eb2953c41fef","name":"stdout","source":"72e5eb2953c41fef.txt","type":"text/plain","size":639}],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumOfIntervalsTestCase::0","time":{"start":1724735127407,"stop":1724735127407,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"INTEGERS"},{"name":"feature","value":"Aggregations"},{"name":"tag","value":"MATHEMATICS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"AGGREGATIONS"},{"name":"story","value":"Sum of Intervals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_of_intervals.test_sum_of_intervals"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52b7ed099cdc285c300001cd/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","INTEGERS","ARITHMETIC","AGGREGATIONS","ALGORITHMS"]},"source":"99a774ce5ee6bba3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/99bd3e79aeea5636.json b/allure-report/data/test-cases/99bd3e79aeea5636.json new file mode 100644 index 00000000000..e7c1a4e72fc --- /dev/null +++ b/allure-report/data/test-cases/99bd3e79aeea5636.json @@ -0,0 +1 @@ +{"uid":"99bd3e79aeea5636","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_2","historyId":"72a2d75b45f09e520765f369cfc2bc8f","time":{"start":1732764221033,"stop":1732764221033,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732764221024,"stop":1732764221024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732764221033,"stop":1732764221033,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732764221042,"stop":1732764221042,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Math"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"95e685797940e119","status":"passed","time":{"start":1732428196244,"stop":1732428196245,"duration":1}},{"uid":"99e31d655e3161a","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"83b34d0610fd83c6","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"371c743cf6f64f1d","status":"passed","time":{"start":1732428196244,"stop":1732428196245,"duration":1}},{"uid":"26cf86ca9eda4b5","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"34febd97f08d8df7","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"99bd3e79aeea5636.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/99e31d655e3161a.json b/allure-report/data/test-cases/99e31d655e3161a.json new file mode 100644 index 00000000000..336f5a33fad --- /dev/null +++ b/allure-report/data/test-cases/99e31d655e3161a.json @@ -0,0 +1 @@ +{"uid":"99e31d655e3161a","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_2","historyId":"72a2d75b45f09e520765f369cfc2bc8f","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"99e31d655e3161a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5d373bcba925975c.json b/allure-report/data/test-cases/99e68c3ce0169a01.json similarity index 64% rename from allure-report/data/test-cases/5d373bcba925975c.json rename to allure-report/data/test-cases/99e68c3ce0169a01.json index 66696f89baf..a81470622e3 100644 --- a/allure-report/data/test-cases/5d373bcba925975c.json +++ b/allure-report/data/test-cases/99e68c3ce0169a01.json @@ -1 +1 @@ -{"uid":"5d373bcba925975c","name":"Testing valid_parentheses function","fullName":"kyu_5.valid_parentheses.test_valid_parentheses.ValidParenthesesTestCase#test_valid_parentheses","historyId":"92164414ad94bf1f5638230345fa606d","time":{"start":1732428194535,"stop":1732428194535,"duration":0},"description":"\n Test the function called that takes a string of parentheses,\n and determines if the order of the parentheses is valid.\n The function should return true if the string is valid,\n and false if it's invalid.\n\n Examples\n\n \"()\" => true\n \")(()))\" => false\n \"(\" => false\n \"(())((()())())\" => true\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1732764221370,"stop":1732764221371,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1732764221371,"stop":1732764221371,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1732764221378,"stop":1732764221378,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"story","value":"Testing gen_primes util"},{"name":"suite","value":"No kyu helper methods"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"f585eec372fcc899","status":"passed","time":{"start":1732428196496,"stop":1732428196496,"duration":0}},{"uid":"65f6b4f1195a0e9d","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"e2a8e239adf783da","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"dd76819b5fd836d3","status":"passed","time":{"start":1732428196496,"stop":1732428196496,"duration":0}},{"uid":"69f65011f131e2b6","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"5e4b0e05a0862f7e","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"9b0ec4eb2cd2dde7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7b13f1197b1367b6.json b/allure-report/data/test-cases/9b5105f2c1baa9ed.json similarity index 69% rename from allure-report/data/test-cases/7b13f1197b1367b6.json rename to allure-report/data/test-cases/9b5105f2c1baa9ed.json index 0ac6dbc7515..72fe105264d 100644 --- a/allure-report/data/test-cases/7b13f1197b1367b6.json +++ b/allure-report/data/test-cases/9b5105f2c1baa9ed.json @@ -1 +1 @@ -{"uid":"7b13f1197b1367b6","name":"All chars are in mixed case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_mixed","historyId":"d4bb68fb8c0e59fc03fed525cca43eb5","time":{"start":1724735128000,"stop":1724735128000,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in mixed case\n :return:\n ","descriptionHtml":"Test a function valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase","time":{"start":1732764218691,"stop":1732764218691,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function validSolution/ValidateSolution/valid_solution()\n that accepts a 2D array representing a Sudoku board, and returns\n true if it is a valid solution, or false otherwise. The cells of\n the sudoku board may also contain 0's, which will represent empty\n cells. Boards containing one or more zeroes are considered to be\n invalid solutions.\n\n The board is always 9 cells by 9 cells, and every\n cell only contains integers from 0 to 9.\n :return:\n ","descriptionHtml":"Test a function valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.
The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.
","status":"passed","steps":[{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]) and verify the output (True) vs expected (True)","time":{"start":1732764218691,"stop":1732764218691,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 0, 3, 4, 9], [1, 0, 0, 3, 4, 2, 5, 6, 0], [8, 5, 9, 7, 6, 1, 0, 2, 0], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 0, 1, 5, 3, 7, 2, 1, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 0, 0, 4, 8, 1, 1, 7, 9]]) and verify the output (False) vs expected (False)","time":{"start":1732764218691,"stop":1732764218691,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([[1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 3, 4, 5, 6, 7, 8, 9, 1], [3, 4, 5, 6, 7, 8, 9, 1, 2], [4, 5, 6, 7, 8, 9, 1, 2, 3], [5, 6, 7, 8, 9, 1, 2, 3, 4], [6, 7, 8, 9, 1, 2, 3, 4, 5], [7, 8, 9, 1, 2, 3, 4, 5, 6], [8, 9, 1, 2, 3, 4, 5, 6, 7], [9, 1, 2, 3, 4, 5, 6, 7, 8]]) and verify the output (False) vs expected (False)","time":{"start":1732764218691,"stop":1732764218691,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ValidSolutionTestCase::0","time":{"start":1732764218692,"stop":1732764218692,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Validation"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"VALIDATION"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Sudoku Solution Validator"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sudoku_solution_validator.test_valid_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/529bf0e9bdf7657179000008","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"6d9aec252d158762","status":"passed","time":{"start":1732428194039,"stop":1732428194040,"duration":1}},{"uid":"2ac4d21875a44bdb","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}},{"uid":"7677af29e8a1671e","status":"passed","time":{"start":1724733472437,"stop":1724733472437,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"91c9b008755c7351","status":"passed","time":{"start":1732428194039,"stop":1732428194040,"duration":1}},{"uid":"d6e4ebd44034ff08","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}},{"uid":"af3c309699fc2b8b","status":"passed","time":{"start":1724735127297,"stop":1724735127297,"duration":0}}]},"tags":["VALIDATION","ALGORITHMS","DATA STRUCTURES"]},"source":"9d2b852ea94aa88a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9d50fe36fd5059ab.json b/allure-report/data/test-cases/9d50fe36fd5059ab.json new file mode 100644 index 00000000000..f566120fb42 --- /dev/null +++ b/allure-report/data/test-cases/9d50fe36fd5059ab.json @@ -0,0 +1 @@ +{"uid":"9d50fe36fd5059ab","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Extend the list list","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473155,"stop":1724733473155,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8ecb0410a6ed3d7","name":"stdout","source":"8ecb0410a6ed3d7.txt","type":"text/plain","size":375}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"9d50fe36fd5059ab.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9dc0ca62f1db510f.json b/allure-report/data/test-cases/9dc0ca62f1db510f.json new file mode 100644 index 00000000000..939bbce6a9f --- /dev/null +++ b/allure-report/data/test-cases/9dc0ca62f1db510f.json @@ -0,0 +1 @@ +{"uid":"9dc0ca62f1db510f","name":"a and b are equal","fullName":"kyu_7.disemvowel_trolls.test_disemvowel_trolls.DisemvowelTestCase#test_disemvowel","historyId":"4171a558a2bea15b5a0546d36c9a1c63","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"description":"\n The string \"This website is for losers LOL!\"\n should become \"Ths wbst s fr lsrs LL!\"\n :return:\n ","descriptionHtml":"Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a1b53b199c1c867e.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"9eac58d1342209e0","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"9eac58d1342209e0.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/b2705032891531e8.json b/allure-report/data/test-cases/9ece4d55c6bd3b35.json
similarity index 65%
rename from allure-report/data/test-cases/b2705032891531e8.json
rename to allure-report/data/test-cases/9ece4d55c6bd3b35.json
index 6ab9972060d..49dd68e6cec 100644
--- a/allure-report/data/test-cases/b2705032891531e8.json
+++ b/allure-report/data/test-cases/9ece4d55c6bd3b35.json
@@ -1 +1 @@
-{"uid":"b2705032891531e8","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1732428196453,"stop":1732428196455,"duration":2},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1732428196456,"stop":1732428196456,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Will you make it?"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f040925d9e513197","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}},{"uid":"6f0b2af516b0f755","status":"passed","time":{"start":1724733474975,"stop":1724733474975,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"afae2f3faef55f2b","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}},{"uid":"627a7fd2fe38a284","status":"passed","time":{"start":1724735129742,"stop":1724735129742,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"b2705032891531e8.json","parameterValues":[]} \ No newline at end of file +{"uid":"9ece4d55c6bd3b35","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1732428196453,"stop":1732428196455,"duration":2},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1732428196453,"stop":1732428196453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1732428196456,"stop":1732428196456,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Will you make it?"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"9ece4d55c6bd3b35.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c5f3069d223f82c6.json b/allure-report/data/test-cases/9ee094a1f359821e.json similarity index 65% rename from allure-report/data/test-cases/c5f3069d223f82c6.json rename to allure-report/data/test-cases/9ee094a1f359821e.json index 4ef8a2af8dd..afb77b80612 100644 --- a/allure-report/data/test-cases/c5f3069d223f82c6.json +++ b/allure-report/data/test-cases/9ee094a1f359821e.json @@ -1 +1 @@ -{"uid":"c5f3069d223f82c6","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6dccc5ff56326cce","name":"stdout","source":"6dccc5ff56326cce.txt","type":"text/plain","size":882}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"c5f3069d223f82c6.json","parameterValues":[]} \ No newline at end of file +{"uid":"9ee094a1f359821e","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"6de140d5a479d77f","name":"stdout","source":"6de140d5a479d77f.txt","type":"text/plain","size":882}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1724735127282,"stop":1724735127282,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"9ee094a1f359821e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d4af7c6dd9a36bc3.json b/allure-report/data/test-cases/9ef5212b94420bba.json similarity index 63% rename from allure-report/data/test-cases/d4af7c6dd9a36bc3.json rename to allure-report/data/test-cases/9ef5212b94420bba.json index a1407146519..4275232a9df 100644 --- a/allure-report/data/test-cases/d4af7c6dd9a36bc3.json +++ b/allure-report/data/test-cases/9ef5212b94420bba.json @@ -1 +1 @@ -{"uid":"d4af7c6dd9a36bc3","name":"Testing 'letter_count' function","fullName":"kyu_6.count_letters_in_string.test_count_letters_in_string.CountLettersInStringTestCase#test_count_letters_in_string","historyId":"04bb543ec741bd163e341a33a1623692","time":{"start":1724733473124,"stop":1724733473124,"duration":0},"description":"\n Testing 'letter_count' function\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e1db63f604b55e53","name":"stdout","source":"e1db63f604b55e53.txt","type":"text/plain","size":1515}],"parameters":[],"hasContent":true,"stepsCount":13,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Human readable duration format"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"bc039aea1f276c5c.json","parameterValues":[]} \ No newline at end of file +{"uid":"9f41894781b470ee","name":"Testing format_duration","fullName":"kyu_4.human_readable_duration_format.test_format_duration.FormatDurationTestCase#test_format_duration","historyId":"7175898242492ec1d3bdd5698d625ca4","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function which formats a duration,\n given as a number of seconds, in a human-friendly way.\n\n The function must accept a non-negative integer.\n If it is zero, it just returns \"now\". Otherwise,\n the duration is expressed as a combination of years,\n days, hours, minutes and seconds.\n :return:\n ","descriptionHtml":"Test a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept a non-negative integer. If it is zero, it just returns \"now\". Otherwise, the duration is expressed as a combination of years, days, hours, minutes and seconds.
","status":"passed","steps":[{"name":"Enter seconds (1) and verify the expected output (1 second) vs actual result (1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (62) and verify the expected output (1 minute and 2 seconds) vs actual result (1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (120) and verify the expected output (2 minutes) vs actual result (2 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3600) and verify the expected output (1 hour) vs actual result (1 hour)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (3662) and verify the expected output (1 hour, 1 minute and 2 seconds) vs actual result (1 hour, 1 minute and 2 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (15731080) and verify the expected output (182 days, 1 hour, 44 minutes and 40 seconds) vs actual result (182 days, 1 hour, 44 minutes and 40 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (132030240) and verify the expected output (4 years, 68 days, 3 hours and 4 minutes) vs actual result (4 years, 68 days, 3 hours and 4 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (205851834) and verify the expected output (6 years, 192 days, 13 hours, 3 minutes and 54 seconds) vs actual result (6 years, 192 days, 13 hours, 3 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (253374061) and verify the expected output (8 years, 12 days, 13 hours, 41 minutes and 1 second) vs actual result (8 years, 12 days, 13 hours, 41 minutes and 1 second)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (242062374) and verify the expected output (7 years, 246 days, 15 hours, 32 minutes and 54 seconds) vs actual result (7 years, 246 days, 15 hours, 32 minutes and 54 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (101956166) and verify the expected output (3 years, 85 days, 1 hour, 9 minutes and 26 seconds) vs actual result (3 years, 85 days, 1 hour, 9 minutes and 26 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (33243586) and verify the expected output (1 year, 19 days, 18 hours, 19 minutes and 46 seconds) vs actual result (1 year, 19 days, 18 hours, 19 minutes and 46 seconds)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter seconds (9041160) and verify the expected output (104 days, 15 hours and 26 minutes) vs actual result (104 days, 15 hours and 26 minutes)","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f135592d4f270e5c","name":"stdout","source":"f135592d4f270e5c.txt","type":"text/plain","size":1515}],"parameters":[],"stepsCount":13,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FormatDurationTestCase::0","time":{"start":1724733472358,"stop":1724733472358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Human readable duration format"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"DATES/TIME"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.human_readable_duration_format.test_format_duration"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52742f58faf5485cae000b9a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","DATES/TIME","FORMATS","ALGORITHMS"]},"source":"9f41894781b470ee.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d97402e929388a59.json b/allure-report/data/test-cases/9f8d638b621270bd.json similarity index 66% rename from allure-report/data/test-cases/d97402e929388a59.json rename to allure-report/data/test-cases/9f8d638b621270bd.json index 75d12d26db1..633b1cff8dd 100644 --- a/allure-report/data/test-cases/d97402e929388a59.json +++ b/allure-report/data/test-cases/9f8d638b621270bd.json @@ -1 +1 @@ -{"uid":"d97402e929388a59","name":"a or b is negative","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_negative_numbers","historyId":"2889ca714f21625b11b311b780ead719","time":{"start":1724733474179,"stop":1724733474179,"duration":0},"description":"\n a or b is negative\n :return:\n ","descriptionHtml":"Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Test the function taht organizes a sports league in a round-robin-system. Each team meets all other teams. In your league a win gives a team 2 points, a draw gives both teams 1 point. After some games you have to compute the order of the teams in your league. You use the following criteria to arrange the teams:
Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c258bec5b6c8eafe","name":"stdout","source":"c258bec5b6c8eafe.txt","type":"text/plain","size":611}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"acf49fc01f491be4.json","parameterValues":[]} \ No newline at end of file +{"uid":"a0013817978e9f1b","name":"'fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"94063c17619b52a4","name":"stdout","source":"94063c17619b52a4.txt","type":"text/plain","size":611}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1724733474850,"stop":1724733474850,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"LISTS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"My head is at the wrong end!"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"a0013817978e9f1b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d121ae5a75cc69b9.json b/allure-report/data/test-cases/a0332cc6a682faac.json similarity index 66% rename from allure-report/data/test-cases/d121ae5a75cc69b9.json rename to allure-report/data/test-cases/a0332cc6a682faac.json index 3b2bbae67fe..d35e3c87b9d 100644 --- a/allure-report/data/test-cases/d121ae5a75cc69b9.json +++ b/allure-report/data/test-cases/a0332cc6a682faac.json @@ -1 +1 @@ -{"uid":"d121ae5a75cc69b9","name":"Testing hoop_count function (positive test case)","fullName":"kyu_8.keep_up_the_hoop.test_hoop_count.HoopCountTestCase#test_hoop_count_positive","historyId":"4110170ab332498939ad9f2d0f38cf97","time":{"start":1732428196294,"stop":1732428196294,"duration":0},"description":"\n Testing hoop_count function (positive)\n\n Alex just got a new hula hoop, he loves it but feels\n discouraged because his little brother is better than him\n\n Write a program where Alex can input (n) how many times\n the hoop goes round and it will return him an encouraging message\n\n - 10 or more hoops, return \"Great, now move on to tricks\".\n\n - Not 10 hoops, return \"Keep at it until you get it\".\n\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"880a2c92c8612a83","name":"stdout","source":"880a2c92c8612a83.txt","type":"text/plain","size":204}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"15dbab6d625f40d3.json","parameterValues":[]} \ No newline at end of file +{"uid":"a07fccce3e37ee4a","name":"Testing dirReduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"5cd6ffe4ff4d743f","name":"stdout","source":"5cd6ffe4ff4d743f.txt","type":"text/plain","size":204}],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724735127485,"stop":1724735127485,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"a07fccce3e37ee4a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c6f52d0b9e8ac3c5.json b/allure-report/data/test-cases/a12dc2585f9de41f.json similarity index 72% rename from allure-report/data/test-cases/c6f52d0b9e8ac3c5.json rename to allure-report/data/test-cases/a12dc2585f9de41f.json index c292f81dd96..e1f2ee41e70 100644 --- a/allure-report/data/test-cases/c6f52d0b9e8ac3c5.json +++ b/allure-report/data/test-cases/a12dc2585f9de41f.json @@ -1 +1 @@ -{"uid":"c6f52d0b9e8ac3c5","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"dd90e5bd6518035b","name":"stdout","source":"dd90e5bd6518035b.txt","type":"text/plain","size":230}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"feature","value":"Tuple"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"c6f52d0b9e8ac3c5.json","parameterValues":[]} \ No newline at end of file +{"uid":"a12dc2585f9de41f","name":"Testing 'greek_comparator' function","fullName":"kyu_8.greek_sort.test_greek_comparator.GreekComparatorTestCase#test_greek_comparator","historyId":"a1dee0241acea84cdb83fd9eaabd5c04","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"312062c4d3ad84ef","name":"stdout","source":"312062c4d3ad84ef.txt","type":"text/plain","size":230}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1724733474725,"stop":1724733474725,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"feature","value":"Tuple"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Greek Sort"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"a12dc2585f9de41f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a13c451f0f676900.json b/allure-report/data/test-cases/a13c451f0f676900.json new file mode 100644 index 00000000000..6005a567ec9 --- /dev/null +++ b/allure-report/data/test-cases/a13c451f0f676900.json @@ -0,0 +1 @@ +{"uid":"a13c451f0f676900","name":"'multiply' function verification with one element list","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest_one_element_list","historyId":"95946a599255beb095c6c7c676174082","time":{"start":1732764220628,"stop":1732764220637,"duration":9},"description":"\n Returns [] if list has only one element\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"30a819977a6f7bba","name":"stdout","source":"30a819977a6f7bba.txt","type":"text/plain","size":1380}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"suite","value":"Character Encodings"},{"name":"feature","value":"String"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"BINARY"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"f00b7b6604c5e7e4.json","parameterValues":[]} \ No newline at end of file +{"uid":"a22d4b8f003df599","name":"Testing binary_to_string function","fullName":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string.SequenceTestCase#test_binary_to_string","historyId":"5e3d4a7b89a7ecee6b57c2383b63527b","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"dd8004b465c9b5f8","name":"stdout","source":"dd8004b465c9b5f8.txt","type":"text/plain","size":1380}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"suite","value":"Character Encodings"},{"name":"feature","value":"String"},{"name":"tag","value":"FORMATS"},{"name":"tag","value":"BINARY"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"a22d4b8f003df599.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8c6df3dc2deaaefa.json b/allure-report/data/test-cases/a25791815212e793.json similarity index 70% rename from allure-report/data/test-cases/8c6df3dc2deaaefa.json rename to allure-report/data/test-cases/a25791815212e793.json index 1994bcc0393..47eb3a8d519 100644 --- a/allure-report/data/test-cases/8c6df3dc2deaaefa.json +++ b/allure-report/data/test-cases/a25791815212e793.json @@ -1 +1 @@ -{"uid":"8c6df3dc2deaaefa","name":"Testing 'longest_repetition' function","fullName":"kyu_6.longest_repetition.test_longest_repetition.LongestRepetitionTestCase#test_longest_repetition","historyId":"6431e0366c9c302e03ac01343fb7ea77","time":{"start":1724733473976,"stop":1724733473976,"duration":0},"description":"\n For a given string s find the character c (or C) with\n longest consecutive repetition and return: (c, l)\n where l (or L) is the length of the repetition.\n\n For empty string return: ('', 0)\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1732428193991,"stop":1732428193991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193993,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1732428193993,"stop":1732428193993,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1732428193994,"stop":1732428193994,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f9c645ee48c4616c","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}},{"uid":"a7d4500da5fb8933","status":"passed","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"b01fd4e8d095b60f","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}},{"uid":"913459f449cde9ee","status":"passed","time":{"start":1724735127235,"stop":1724735127250,"duration":15}}]},"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"5eca272b3b393557.json","parameterValues":[]} \ No newline at end of file +{"uid":"a329da92784fccae","name":"Testing next_smaller function","fullName":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller.NextSmallerTestCase#test_next_smaller","historyId":"9d8cb8adf1764c55348d349698b938ac","time":{"start":1732428193992,"stop":1732428193993,"duration":1},"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1732428193991,"stop":1732428193991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1732428193992,"stop":1732428193992,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1732428193992,"stop":1732428193993,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1732428193993,"stop":1732428193993,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1732428193994,"stop":1732428193994,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"a329da92784fccae.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/85df8de56a96ab7c.json b/allure-report/data/test-cases/a35155a27bb8937d.json similarity index 93% rename from allure-report/data/test-cases/85df8de56a96ab7c.json rename to allure-report/data/test-cases/a35155a27bb8937d.json index 888fbddf831..28961e88f41 100644 --- a/allure-report/data/test-cases/85df8de56a96ab7c.json +++ b/allure-report/data/test-cases/a35155a27bb8937d.json @@ -1 +1 @@ -{"uid":"85df8de56a96ab7c","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"85df8de56a96ab7c.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"a35155a27bb8937d","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724735127188,"stop":1724735127188,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a35155a27bb8937d.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a3b2f77071e9a780.json b/allure-report/data/test-cases/a355bc32a0d73da0.json
similarity index 70%
rename from allure-report/data/test-cases/a3b2f77071e9a780.json
rename to allure-report/data/test-cases/a355bc32a0d73da0.json
index 9e0b98fbf71..622346b2b45 100644
--- a/allure-report/data/test-cases/a3b2f77071e9a780.json
+++ b/allure-report/data/test-cases/a355bc32a0d73da0.json
@@ -1 +1 @@
-{"uid":"a3b2f77071e9a780","name":"Should return 'Fail!'s","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_fail","historyId":"a12b9599b8bf7b92d2c2e1462a17342d","time":{"start":1724735129711,"stop":1724735129711,"duration":0},"description":"\n If there are no good ideas,\n as is often the case, return 'Fail!'.\n :return:\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc class\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":21,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1732428193894,"stop":1732428193894,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"OPERATORS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5961f436380e11d2","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}},{"uid":"57e5e5f4d9d91cf6","status":"passed","time":{"start":1724733472280,"stop":1724733472280,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"693c5b2693478689","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}},{"uid":"d6d06cbc227917e","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}}]},"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"c77f51e83226296c.json","parameterValues":[]} \ No newline at end of file +{"uid":"a39b53ea962a31f1","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"description":"\n Testing calc class\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc class\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1732428193889,"stop":1732428193889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":21,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1732428193894,"stop":1732428193894,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"tag","value":"OPERATORS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"a39b53ea962a31f1.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5af3f258cf327b2a.json b/allure-report/data/test-cases/a3ca7d068d3e7d87.json similarity index 56% rename from allure-report/data/test-cases/5af3f258cf327b2a.json rename to allure-report/data/test-cases/a3ca7d068d3e7d87.json index 5dfdc8fcd42..c7adb43a423 100644 --- a/allure-report/data/test-cases/5af3f258cf327b2a.json +++ b/allure-report/data/test-cases/a3ca7d068d3e7d87.json @@ -1 +1 @@ -{"uid":"5af3f258cf327b2a","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[{"name":"Assert that classes Bob and Bob have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes Dog and Dog have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes 5 and 5 have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes good and good have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes 50lb and 50lb have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes brown and brown have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1732428195883,"stop":1732428195883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"GAMES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d12fb82b623fefb9","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}},{"uid":"c6923016c0d7805e","status":"passed","time":{"start":1724733474319,"stop":1724733474319,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"dead64fe3d4f484d","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}},{"uid":"91ff78dc5a767b91","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","GAMES","ALGORITHMS"]},"source":"5af3f258cf327b2a.json","parameterValues":[]} \ No newline at end of file +{"uid":"a3ca7d068d3e7d87","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[{"name":"Assert that classes Bob and Bob have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes Dog and Dog have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes 5 and 5 have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes good and good have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes 50lb and 50lb have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes brown and brown have equal properties","time":{"start":1732428195882,"stop":1732428195882,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1732428195883,"stop":1732428195883,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"GAMES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","GAMES","ALGORITHMS"]},"source":"a3ca7d068d3e7d87.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a3cba1eb012d0834.json b/allure-report/data/test-cases/a3cba1eb012d0834.json new file mode 100644 index 00000000000..a8598fc4735 --- /dev/null +++ b/allure-report/data/test-cases/a3cba1eb012d0834.json @@ -0,0 +1 @@ +{"uid":"a3cba1eb012d0834","name":"Testing first_non_repeated function with various inputs","fullName":"kyu_7.the_first_non_repeated_character_in_string.test_first_non_repeated.FirstNonRepeatedTestCase#test_first_non_repeated","historyId":"9398abf0c9f75b70331fc87dcc2b8a7f","time":{"start":1732764220770,"stop":1732764220770,"duration":0},"description":"\n Testing first_non_repeated function\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3a4c00d99760de4b","name":"stdout","source":"3a4c00d99760de4b.txt","type":"text/plain","size":908}],"parameters":[],"hasContent":true,"stepsCount":14,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"DECLARATIVE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PROGRAMMING"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ADVANCED"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","PROGRAMMING","FUNDAMENTALS","FEATURES","ADVANCED"]},"source":"13ca3a7cd8b0e3af.json","parameterValues":[]} \ No newline at end of file +{"uid":"a456e8af4c590649","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1724735127438,"stop":1724735127453,"duration":15},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f5e7c985bb14104f","name":"stdout","source":"f5e7c985bb14104f.txt","type":"text/plain","size":908}],"parameters":[],"stepsCount":14,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"DECLARATIVE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"LANGUAGE"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PROGRAMMING"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FEATURES"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ADVANCED"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","PROGRAMMING","FUNDAMENTALS","FEATURES","ADVANCED"]},"source":"a456e8af4c590649.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/33a4a469899e9868.json b/allure-report/data/test-cases/a4637a157e542cb8.json similarity index 65% rename from allure-report/data/test-cases/33a4a469899e9868.json rename to allure-report/data/test-cases/a4637a157e542cb8.json index 79f7b0c0fa6..9526abb730e 100644 --- a/allure-report/data/test-cases/33a4a469899e9868.json +++ b/allure-report/data/test-cases/a4637a157e542cb8.json @@ -1 +1 @@ -{"uid":"33a4a469899e9868","name":"Testing share_price function","fullName":"kyu_7.share_prices.test_share_price.SharePriceTestCase#test_share_price","historyId":"884fcf3671ca321076723a238ddb92c0","time":{"start":1724733474413,"stop":1724733474413,"duration":0},"description":"\n Testing share_price function\n with multiple test inputs\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e0673a9df06bdbef","name":"stdout","source":"e0673a9df06bdbef.txt","type":"text/plain","size":565}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"a7d4500da5fb8933.json","parameterValues":[]} \ No newline at end of file +{"uid":"a53e477b227bdf44","name":"Testing next_smaller function","fullName":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller.NextSmallerTestCase#test_next_smaller","historyId":"9d8cb8adf1764c55348d349698b938ac","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d473fba435502d8","name":"stdout","source":"d473fba435502d8.txt","type":"text/plain","size":565}],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"a53e477b227bdf44.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5c78d3bc5a71109a.json b/allure-report/data/test-cases/a5467cc7a05b3546.json similarity index 71% rename from allure-report/data/test-cases/5c78d3bc5a71109a.json rename to allure-report/data/test-cases/a5467cc7a05b3546.json index f8784a5315c..9d35859571b 100644 --- a/allure-report/data/test-cases/5c78d3bc5a71109a.json +++ b/allure-report/data/test-cases/a5467cc7a05b3546.json @@ -1 +1 @@ -{"uid":"5c78d3bc5a71109a","name":"Testing make_upper_case function","fullName":"kyu_8.make_upper_case.test_make_upper_case.MakeUpperCaseTestCase#test_make_upper_case","historyId":"9fe496d12a67f53b3208a0b823f2d8c3","time":{"start":1724733474835,"stop":1724733474835,"duration":0},"description":"\n Sample Tests for make_upper_case function\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194678,"stop":1732428194678,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Remove items from the list","time":{"start":1732428194678,"stop":1732428194679,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194679,"stop":1732428194679,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194679,"stop":1732428194679,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5519a1e9b61f2ca3","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}},{"uid":"4b8d012f19a4e1e6","status":"passed","time":{"start":1724733473171,"stop":1724733473186,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"51a9aec46de8d878","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}},{"uid":"43c0068fe0a1265e","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"239a317b6e090fd8.json","parameterValues":[]} \ No newline at end of file +{"uid":"a6a59cc8a0131a02","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1732428194678,"stop":1732428194679,"duration":1},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194678,"stop":1732428194678,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Remove items from the list","time":{"start":1732428194678,"stop":1732428194679,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194679,"stop":1732428194679,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194679,"stop":1732428194679,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"a6a59cc8a0131a02.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a6d26dfb90ab4062.json b/allure-report/data/test-cases/a6d26dfb90ab4062.json new file mode 100644 index 00000000000..2e07582c45d --- /dev/null +++ b/allure-report/data/test-cases/a6d26dfb90ab4062.json @@ -0,0 +1 @@ +{"uid":"a6d26dfb90ab4062","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"description":"\n Testing calc class\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1732764218535,"stop":1732764218535,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc class\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1732764218536,"stop":1732764218536,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":21,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1732764218539,"stop":1732764218539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"OPERATORS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"PARSING STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a39b53ea962a31f1","status":"passed","time":{"start":1732428193889,"stop":1732428193889,"duration":0}},{"uid":"500f182a6eedd000","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}},{"uid":"bae98e899f1ebab4","status":"passed","time":{"start":1724733472280,"stop":1724733472280,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"c77f51e83226296c","status":"passed","time":{"start":1732428193889,"stop":1732428193889,"duration":0}},{"uid":"693c5b2693478689","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}},{"uid":"d6d06cbc227917e","status":"passed","time":{"start":1724735127122,"stop":1724735127141,"duration":19}}]},"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"a6d26dfb90ab4062.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8e7bc3e134c68e92.json b/allure-report/data/test-cases/a6f428498c7694b0.json similarity index 61% rename from allure-report/data/test-cases/8e7bc3e134c68e92.json rename to allure-report/data/test-cases/a6f428498c7694b0.json index 9a0b976a332..23c61116a7b 100644 --- a/allure-report/data/test-cases/8e7bc3e134c68e92.json +++ b/allure-report/data/test-cases/a6f428498c7694b0.json @@ -1 +1 @@ -{"uid":"8e7bc3e134c68e92","name":"Testing increment_string function","fullName":"kyu_5.string_incrementer.test_increment_string.StringIncrementerTestCase#test_increment_string","historyId":"5d0f5e220c2579103119e57300b46215","time":{"start":1724735127891,"stop":1724735127891,"duration":0},"description":"\n Testing a function named increment_string\n\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"34515415abccae34","name":"stdout","source":"34515415abccae34.txt","type":"text/plain","size":717}],"parameters":[],"hasContent":true,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"951576068e42ee36.json","parameterValues":[]} \ No newline at end of file +{"uid":"a7599be0f5459a3d","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724733473944,"stop":1724733473944,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"85813043366b6b90","name":"stdout","source":"85813043366b6b90.txt","type":"text/plain","size":717}],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724733473960,"stop":1724733473960,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"FORMATTING"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"a7599be0f5459a3d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a75aa53086c60820.json b/allure-report/data/test-cases/a75aa53086c60820.json new file mode 100644 index 00000000000..d95416e83cc --- /dev/null +++ b/allure-report/data/test-cases/a75aa53086c60820.json @@ -0,0 +1 @@ +{"uid":"a75aa53086c60820","name":"a and b are equal","fullName":"kyu_7.disemvowel_trolls.test_disemvowel_trolls.DisemvowelTestCase#test_disemvowel","historyId":"4171a558a2bea15b5a0546d36c9a1c63","time":{"start":1732428195767,"stop":1732428195767,"duration":0},"description":"\n The string \"This website is for losers LOL!\"\n should become \"Ths wbst s fr lsrs LL!\"\n :return:\n ","descriptionHtml":"Testing position property based on negative grids.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":true,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":"Testing position property based on negative grids.
","status":"passed","steps":[{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase::0","time":{"start":1732428193935,"stop":1732428193935,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"3c0afff932465669","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"30b1174850b5a822","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472327,"stop":1724733472327,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":2,"passed":1,"unknown":0,"total":3},"items":[{"uid":"801bdccb4e1aa824","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"92b17e5074e54ef7","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"a76c277b6c0b5940.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a78b9243c26a61bf.json b/allure-report/data/test-cases/a78b9243c26a61bf.json new file mode 100644 index 00000000000..9a605713960 --- /dev/null +++ b/allure-report/data/test-cases/a78b9243c26a61bf.json @@ -0,0 +1 @@ +{"uid":"a78b9243c26a61bf","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Append the list","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732764219359,"stop":1732764219359,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"story","value":"DefaultList"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"875e90b046ec092c","status":"passed","time":{"start":1732428194650,"stop":1732428194650,"duration":0}},{"uid":"f25197354d7a779d","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}},{"uid":"86447fe348b226fe","status":"passed","time":{"start":1724733473139,"stop":1724733473139,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"2655a1e6934b1850","status":"passed","time":{"start":1732428194650,"stop":1732428194650,"duration":0}},{"uid":"b5a45493f51c1d67","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}},{"uid":"7f890ca68cdfc481","status":"passed","time":{"start":1724735128031,"stop":1724735128047,"duration":16}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"a78b9243c26a61bf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a7d954f4aff6f601.json b/allure-report/data/test-cases/a7d954f4aff6f601.json new file mode 100644 index 00000000000..f7406d1a053 --- /dev/null +++ b/allure-report/data/test-cases/a7d954f4aff6f601.json @@ -0,0 +1 @@ +{"uid":"a7d954f4aff6f601","name":"'multiply' function verification with one element list","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest_one_element_list","historyId":"95946a599255beb095c6c7c676174082","time":{"start":1724735129211,"stop":1724735129211,"duration":0},"description":"\n Returns [] if list has only one element\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence\n types, the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"12ac45051c49f01a","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"d7eae685c38fccbb","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"ef7e94367cfcafa4","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"14e29fc6b385d9d8","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"8da01589d3299948.json","parameterValues":[]} \ No newline at end of file +{"uid":"a8e7ed0b9e8a05d4","name":"Testing 'DefaultList' class: __getitem__","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_basic","historyId":"7dba0545991d74ec4981bfb3eea48559","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence\n types, the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: __getitem__\n\n Called to implement evaluation of self[key]. For sequence\n types, the accepted keys should be integers and slice objects.\n Note that the special interpretation of negative indexes\n (if the class wishes to emulate a sequence type) is up to the\n __getitem__() method.\n :return:\n ","descriptionHtml":"Testing __getitem__ method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194656,"stop":1732428194656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"a8e7ed0b9e8a05d4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c7eea171ede7ee13.json b/allure-report/data/test-cases/a8ee14a37e5c3cb6.json similarity index 68% rename from allure-report/data/test-cases/c7eea171ede7ee13.json rename to allure-report/data/test-cases/a8ee14a37e5c3cb6.json index 0d268cbf43f..3788c87994d 100644 --- a/allure-report/data/test-cases/c7eea171ede7ee13.json +++ b/allure-report/data/test-cases/a8ee14a37e5c3cb6.json @@ -1 +1 @@ -{"uid":"c7eea171ede7ee13","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8b338c3953869594","name":"stdout","source":"8b338c3953869594.txt","type":"text/plain","size":242}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"c7eea171ede7ee13.json","parameterValues":[]} \ No newline at end of file +{"uid":"a8ee14a37e5c3cb6","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"491da570f7a6ee0b","name":"stdout","source":"491da570f7a6ee0b.txt","type":"text/plain","size":242}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724733474288,"stop":1724733474288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"String"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"a8ee14a37e5c3cb6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a8ef326c3cb7b77c.json b/allure-report/data/test-cases/a8ef326c3cb7b77c.json deleted file mode 100644 index c560816e9f1..00000000000 --- a/allure-report/data/test-cases/a8ef326c3cb7b77c.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"a8ef326c3cb7b77c","name":"a and b are equal","fullName":"kyu_7.beginner_series_sum_of_numbers.test_sum_of_numbers.SumOfNumbersTestCase#test_get_sum_equal_numbers","historyId":"2972663ca9fa4b4f0e6ea69060a464d5","time":{"start":1724733474179,"stop":1724733474179,"duration":0},"description":"\n a and b are equal\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732764218803,"stop":1732764218803,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":30,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1732764218810,"stop":1732764218810,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"VALIDATION"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b0df4a2c5fe59a12","status":"passed","time":{"start":1732428194154,"stop":1732428194154,"duration":0}},{"uid":"d4d3736adb97380b","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}},{"uid":"6de398181d9095ee","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"15f47b991f284575","status":"passed","time":{"start":1732428194154,"stop":1732428194154,"duration":0}},{"uid":"7f90afc62f8400f4","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}},{"uid":"a921030da8c9a520","status":"passed","time":{"start":1724735127422,"stop":1724735127438,"duration":16}}]},"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"a908975bd67b2eca.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/602b6b1c829f1e7f.json b/allure-report/data/test-cases/a98592d8e6c7fba2.json similarity index 72% rename from allure-report/data/test-cases/602b6b1c829f1e7f.json rename to allure-report/data/test-cases/a98592d8e6c7fba2.json index db1a6dd753c..6c8ce495852 100644 --- a/allure-report/data/test-cases/602b6b1c829f1e7f.json +++ b/allure-report/data/test-cases/a98592d8e6c7fba2.json @@ -1 +1 @@ -{"uid":"602b6b1c829f1e7f","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"8c002cae94869ae","name":"stdout","source":"8c002cae94869ae.txt","type":"text/plain","size":1127}],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"602b6b1c829f1e7f.json","parameterValues":[]} \ No newline at end of file +{"uid":"a98592d8e6c7fba2","name":"Testing stock_list function","fullName":"kyu_6.help_the_bookseller.test_stock_list.StockListTestCase#test_stock_list","historyId":"dd45bde8a5798bd4dac8809e8aa8206c","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given a stocklist (e.g. : L) and a list of categories in capital letters. Your task is to verify that the function finds all the books of L with codes belonging to each category of M and to sum their quantity according to each category.
","status":"passed","steps":[{"name":"Enter test data (['ABAR 200', 'CDXE 500', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B']) and verify the expected output ((A : 200) - (B : 1140)) vs actual result ((A : 200) - (B : 1140))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['BBAR 150', 'CDXE 515', 'BKWR 250', 'BTSQ 890', 'DRTY 600'], ['A', 'B', 'C', 'D']) and verify the expected output ((A : 0) - (B : 1290) - (C : 515) - (D : 600)) vs actual result ((A : 0) - (B : 1290) - (C : 515) - (D : 600))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['CBART 20', 'CDXEF 50', 'BKWRK 25', 'BTSQZ 89', 'DRTYM 60'], ['A', 'B', 'C', 'W']) and verify the expected output ((A : 0) - (B : 114) - (C : 70) - (W : 0)) vs actual result ((A : 0) - (B : 114) - (C : 70) - (W : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['B', 'R', 'D', 'X']) and verify the expected output ((B : 364) - (R : 225) - (D : 60) - (X : 0)) vs actual result ((B : 364) - (R : 225) - (D : 60) - (X : 0))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['ROXANNE 102', 'RHODODE 123', 'BKWRKAA 125', 'BTSQZFG 239', 'DRTYMKH 060'], ['U', 'V', 'R']) and verify the expected output ((U : 0) - (V : 0) - (R : 225)) vs actual result ((U : 0) - (V : 0) - (R : 225))","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data ([], ['B', 'R', 'D', 'X']) and verify the expected output () vs actual result ()","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2731ba669f341d4","name":"stdout","source":"2731ba669f341d4.txt","type":"text/plain","size":1127}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_StockListTestCase::0","time":{"start":1724735128820,"stop":1724735128820,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Help the bookseller !"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.help_the_bookseller.test_stock_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"a98592d8e6c7fba2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3ec407d8e8742f0d.json b/allure-report/data/test-cases/a9ecee1b4fc0ab11.json similarity index 61% rename from allure-report/data/test-cases/3ec407d8e8742f0d.json rename to allure-report/data/test-cases/a9ecee1b4fc0ab11.json index 6b3dfe50ec6..836b83383a8 100644 --- a/allure-report/data/test-cases/3ec407d8e8742f0d.json +++ b/allure-report/data/test-cases/a9ecee1b4fc0ab11.json @@ -1 +1 @@ -{"uid":"3ec407d8e8742f0d","name":"Testing 'generate_hashtag' function","fullName":"kyu_5.the_hashtag_generator.test_generate_hashtag.GenerateHashtagTestCase#test_generate_hashtag","historyId":"ff2324e4a058a6c42486fd5aff532ecf","time":{"start":1724735127906,"stop":1724735127906,"duration":0},"description":"\n Testing 'generate_hashtag' function\n ","descriptionHtml":"The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have Dog arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 5 arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have good arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 50lb arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have brown arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e04892408ba7673f","name":"stdout","source":"e04892408ba7673f.txt","type":"text/plain","size":148}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"d12fb82b623fefb9.json","parameterValues":[]} \ No newline at end of file +{"uid":"aa1a2a69b8a9bf68","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have Dog arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 5 arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have good arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have 50lb arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes have brown arg","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"cfdd9038af68abcd","name":"stdout","source":"cfdd9038af68abcd.txt","type":"text/plain","size":148}],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724735129164,"stop":1724735129164,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Make Class"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"aa1a2a69b8a9bf68.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/aa37770dd2142a16.json b/allure-report/data/test-cases/aa37770dd2142a16.json new file mode 100644 index 00000000000..c4f30800b05 --- /dev/null +++ b/allure-report/data/test-cases/aa37770dd2142a16.json @@ -0,0 +1 @@ +{"uid":"aa37770dd2142a16","name":"Should return 'Publish!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_publish","historyId":"b4a1fa278aa899a374ebad09960e6cca","time":{"start":1732764221293,"stop":1732764221294,"duration":1},"description":"\n If there are one or two good ideas,\n return 'Publish!',\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1732428194205,"stop":1732428194205,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function dir_reduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['NORTH', 'SOUTH', 'SOUTH', 'EAST', 'WEST', 'NORTH', 'WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'EAST', 'NORTH', 'EAST', 'WEST', 'WEST', 'EAST', 'EAST', 'WEST', 'SOUTH']) and verify the output (['NORTH', 'EAST']) vs expected (['NORTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['EAST', 'NORTH', 'SOUTH', 'NORTH', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'NORTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'SOUTH', 'NORTH', 'NORTH', 'SOUTH', 'WEST', 'NORTH', 'EAST', 'WEST', 'WEST', 'WEST', 'EAST', 'SOUTH', 'SOUTH']) and verify the output (['EAST', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'WEST', 'NORTH', 'WEST', 'SOUTH', 'SOUTH']) vs expected (['EAST', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'WEST', 'NORTH', 'WEST', 'SOUTH', 'SOUTH'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['WEST', 'NORTH', 'EAST', 'EAST', 'EAST', 'EAST', 'WEST', 'WEST', 'WEST', 'WEST', 'NORTH', 'NORTH', 'SOUTH', 'EAST']) and verify the output (['WEST', 'NORTH', 'NORTH', 'EAST']) vs expected (['WEST', 'NORTH', 'NORTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1732428194209,"stop":1732428194209,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Directions Reduction"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"15dbab6d625f40d3","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"8cdb3386cf094e1f","status":"passed","time":{"start":1724733472593,"stop":1724733472593,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"5e6aa533c6c0fafa","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}},{"uid":"d65c16a1b47d468e","status":"passed","time":{"start":1724735127485,"stop":1724735127485,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"5ea5418b10cdf416.json","parameterValues":[]} \ No newline at end of file +{"uid":"aa8525de66192fb3","name":"Testing dir_reduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"description":"\n Test a function dir_reduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1732428194205,"stop":1732428194205,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function dir_reduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['NORTH', 'SOUTH', 'SOUTH', 'EAST', 'WEST', 'NORTH', 'WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'EAST', 'NORTH', 'EAST', 'WEST', 'WEST', 'EAST', 'EAST', 'WEST', 'SOUTH']) and verify the output (['NORTH', 'EAST']) vs expected (['NORTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['EAST', 'NORTH', 'SOUTH', 'NORTH', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'NORTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'SOUTH', 'NORTH', 'NORTH', 'SOUTH', 'WEST', 'NORTH', 'EAST', 'WEST', 'WEST', 'WEST', 'EAST', 'SOUTH', 'SOUTH']) and verify the output (['EAST', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'WEST', 'NORTH', 'WEST', 'SOUTH', 'SOUTH']) vs expected (['EAST', 'SOUTH', 'SOUTH', 'SOUTH', 'SOUTH', 'EAST', 'SOUTH', 'WEST', 'NORTH', 'WEST', 'SOUTH', 'SOUTH'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['WEST', 'NORTH', 'EAST', 'EAST', 'EAST', 'EAST', 'WEST', 'WEST', 'WEST', 'WEST', 'NORTH', 'NORTH', 'SOUTH', 'EAST']) and verify the output (['WEST', 'NORTH', 'NORTH', 'EAST']) vs expected (['WEST', 'NORTH', 'NORTH', 'EAST'])","time":{"start":1732428194207,"stop":1732428194207,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1732428194209,"stop":1732428194209,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"5 kyu"},{"name":"story","value":"Directions Reduction"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"aa8525de66192fb3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ab3687d99fed99d0.json b/allure-report/data/test-cases/ab3687d99fed99d0.json new file mode 100644 index 00000000000..f202e24ea99 --- /dev/null +++ b/allure-report/data/test-cases/ab3687d99fed99d0.json @@ -0,0 +1 @@ +{"uid":"ab3687d99fed99d0","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"status":"passed","steps":[{"name":"Assert that classes Bob and Bob have equal properties","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes Dog and Dog have equal properties","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes 5 and 5 have equal properties","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes good and good have equal properties","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes 50lb and 50lb have equal properties","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert that classes brown and brown have equal properties","time":{"start":1732764220579,"stop":1732764220579,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1732764220582,"stop":1732764220582,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Make Class"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"OOP"},{"name":"tag","value":"GAMES"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"7 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a3ca7d068d3e7d87","status":"passed","time":{"start":1732428195882,"stop":1732428195882,"duration":0}},{"uid":"aa1a2a69b8a9bf68","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}},{"uid":"44e584571b03be2","status":"passed","time":{"start":1724733474319,"stop":1724733474319,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"5af3f258cf327b2a","status":"passed","time":{"start":1732428195882,"stop":1732428195882,"duration":0}},{"uid":"dead64fe3d4f484d","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}},{"uid":"91ff78dc5a767b91","status":"passed","time":{"start":1724735129164,"stop":1724735129164,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","GAMES","ALGORITHMS"]},"source":"ab3687d99fed99d0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/51c4ad89c4a768de.json b/allure-report/data/test-cases/ab62ce2428f0e01f.json similarity index 73% rename from allure-report/data/test-cases/51c4ad89c4a768de.json rename to allure-report/data/test-cases/ab62ce2428f0e01f.json index 2dee6bd2725..55c41ccf411 100644 --- a/allure-report/data/test-cases/51c4ad89c4a768de.json +++ b/allure-report/data/test-cases/ab62ce2428f0e01f.json @@ -1 +1 @@ -{"uid":"51c4ad89c4a768de","name":"Testing 'count_sheeps' function: empty list","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_empty_list","historyId":"64d02b3be7358667808060e04863e8f8","time":{"start":1724735129430,"stop":1724735129430,"duration":0},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like empty list\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"ef14b2090647c37e","name":"stdout","source":"ef14b2090647c37e.txt","type":"text/plain","size":434}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"614d8ec123787b56.json","parameterValues":[]} \ No newline at end of file +{"uid":"ab7f75990cdffa76","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"c2e7b358c14deeef","name":"stdout","source":"c2e7b358c14deeef.txt","type":"text/plain","size":434}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"INTEGERS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"ab7f75990cdffa76.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bfc6af42137d4620.json b/allure-report/data/test-cases/abed1b9a0913387d.json similarity index 63% rename from allure-report/data/test-cases/bfc6af42137d4620.json rename to allure-report/data/test-cases/abed1b9a0913387d.json index 26ca54d9042..57a325f46e0 100644 --- a/allure-report/data/test-cases/bfc6af42137d4620.json +++ b/allure-report/data/test-cases/abed1b9a0913387d.json @@ -1 +1 @@ -{"uid":"bfc6af42137d4620","name":"Testing Calculator class","fullName":"kyu_3.calculator.test_calculator.CalculatorTestCase#test_calculator","historyId":"939a8064e3d28ec85fadd67010b560ae","time":{"start":1724733472312,"stop":1724733472312,"duration":0},"description":"\n Testing Calculator class\n A simple calculator that given a string of operators '()', '+', '-', '*', '/'\n and numbers separated by spaces will return the value of that expression\n\n :return: None\n ","descriptionHtml":"1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
1. given a string of operators '(), +, -, *, /'and numbers separated by spaces
2. the calculator should return the value of that expression
We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"6cd50ae6a92d4a65","name":"stdout","source":"6cd50ae6a92d4a65.txt","type":"text/plain","size":524}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Easy Diagonal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"6113acbf67a69117.json","parameterValues":[]} \ No newline at end of file +{"uid":"abf4f2031d384e78","name":"Testing easy_diagonal function","fullName":"kyu_6.easy_diagonal.test_diagonal.EasyDiagonalTestCase#test_easy_diagonal","historyId":"5d9c9166bf610b28a284723b5b23aab1","time":{"start":1724733473218,"stop":1724733473889,"duration":671},"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724733473218,"stop":1724733473218,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"72a9f976cb96a98d","name":"stdout","source":"72a9f976cb96a98d.txt","type":"text/plain","size":524}],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724733473889,"stop":1724733473889,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Easy Diagonal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"abf4f2031d384e78.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/57d69ca6b172040d.json b/allure-report/data/test-cases/ac35e86bb753fb8c.json similarity index 73% rename from allure-report/data/test-cases/57d69ca6b172040d.json rename to allure-report/data/test-cases/ac35e86bb753fb8c.json index de4e130eb92..544ee8094ba 100644 --- a/allure-report/data/test-cases/57d69ca6b172040d.json +++ b/allure-report/data/test-cases/ac35e86bb753fb8c.json @@ -1 +1 @@ -{"uid":"57d69ca6b172040d","name":"Testing number_of_sigfigs function","fullName":"kyu_7.significant_figures.test_number_of_sigfigs.NumberOfSigFigsTestCase#test_number_of_sigfigs","historyId":"3b2ebb1924dbc4e6a73dc5dda19dd323","time":{"start":1724733474413,"stop":1724733474413,"duration":0},"description":"\n Testing number_of_sigfigs function\n with various test inputs\n :return:\n ","descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function subtracts one list from anotherand returns the result. It should remove all values from list a, which are present in list b.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7d49bbac8d757852","name":"stdout","source":"7d49bbac8d757852.txt","type":"text/plain","size":502}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayDiffTestCase::0","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Array.diff"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_diff.test_array_diff"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/523f5d21c841566fde000009/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"ac81c5ec86387239.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/83b7eb2988572ef6.json b/allure-report/data/test-cases/acf18a2788645a5a.json similarity index 72% rename from allure-report/data/test-cases/83b7eb2988572ef6.json rename to allure-report/data/test-cases/acf18a2788645a5a.json index 25bbb11fc51..367bc3003ec 100644 --- a/allure-report/data/test-cases/83b7eb2988572ef6.json +++ b/allure-report/data/test-cases/acf18a2788645a5a.json @@ -1 +1 @@ -{"uid":"83b7eb2988572ef6","name":"Non square numbers (negative)","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_26","historyId":"49ea03f1d04a92057a336da49714852c","time":{"start":1724733474522,"stop":1724733474522,"duration":0},"description":"\n 26 is not a square number\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pop an un-existing item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2b6038e2de6e977a","name":"stdout","source":"2b6038e2de6e977a.txt","type":"text/plain","size":378}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"a2cc2be21cb9d7cd.json","parameterValues":[]} \ No newline at end of file +{"uid":"adbbb2c26291ccd5","name":"Testing 'DefaultList' class: pop","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_pop","historyId":"e9bfe5ed84336ceb50e9a2cd6d3752ed","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: pop\n :return:\n ","descriptionHtml":"Testing pop method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pop an un-existing item and verify the result","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b8984e5480e91547","name":"stdout","source":"b8984e5480e91547.txt","type":"text/plain","size":378}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"adbbb2c26291ccd5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/addec93357f6e501.json b/allure-report/data/test-cases/addec93357f6e501.json new file mode 100644 index 00000000000..87c9359d084 --- /dev/null +++ b/allure-report/data/test-cases/addec93357f6e501.json @@ -0,0 +1 @@ +{"uid":"addec93357f6e501","name":"Testing largestPower function","fullName":"kyu_7.powers_of_3.test_largest_power.LargestPowerTestCase#test_largest_power","historyId":"026739760bca73e921f8e5d35d9329cf","time":{"start":1732764220605,"stop":1732764220605,"duration":0},"description":"\n Testing largestPower function\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Remove items from the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a66ea3c1c7d07513","name":"stdout","source":"a66ea3c1c7d07513.txt","type":"text/plain","size":254}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"5519a1e9b61f2ca3.json","parameterValues":[]} \ No newline at end of file +{"uid":"ae08758c48a63481","name":"Testing 'DefaultList' class: remove","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_remove","historyId":"15037a348eb4a5d132a73e93b09318c1","time":{"start":1724735128063,"stop":1724735128078,"duration":15},"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Remove items from the list","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128063,"stop":1724735128063,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e01af9821f0d361c","name":"stdout","source":"e01af9821f0d361c.txt","type":"text/plain","size":254}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"ae08758c48a63481.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/566a56003ac2e703.json b/allure-report/data/test-cases/ae4ebdaea3850cc0.json similarity index 64% rename from allure-report/data/test-cases/566a56003ac2e703.json rename to allure-report/data/test-cases/ae4ebdaea3850cc0.json index 6a1d00e00f5..707f73e9600 100644 --- a/allure-report/data/test-cases/566a56003ac2e703.json +++ b/allure-report/data/test-cases/ae4ebdaea3850cc0.json @@ -1 +1 @@ -{"uid":"566a56003ac2e703","name":"Non consecutive number should be returned","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_positive","historyId":"13df60cbdff5ee076adcd6328cc69159","time":{"start":1724735129461,"stop":1724735129461,"duration":0},"description":"\n If we have an array [1,2,3,4,6,7,8] then 1 then 2\n then 3 then 4 are all consecutive but 6 is not,\n so that's the first non-consecutive number.\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"a3e3342383736358","name":"stdout","source":"a3e3342383736358.txt","type":"text/plain","size":717}],"parameters":[],"hasContent":true,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"4544ac5de6415953.json","parameterValues":[]} \ No newline at end of file +{"uid":"ae5dc2ec4f03f9e5","name":"String with no duplicate chars","fullName":"kyu_6.format_string_of_names.test_namelist.NamelistTestCase#test_namelist","historyId":"faebae956c3da12c5f429266c959c030","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test namelist\n\n Given:\n an array containing hashes of names\n\n Return:\n a string formatted as a list of names separated by commas\n except for the last two names, which should be separated\n by an ampersand.\n\n :return:\n ","descriptionHtml":"Should a string formatted as a list of names separated by commas except for the last two names, which should be separated by an ampersand.
","status":"passed","steps":[],"attachments":[{"uid":"c5a486abc69fc1fc","name":"stdout","source":"c5a486abc69fc1fc.txt","type":"text/plain","size":717}],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NamelistTestCase::0","time":{"start":1724735128805,"stop":1724735128805,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Format a string of names like 'Bart, Lisa & Maggie'."},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"FORMATTING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.format_string_of_names.test_namelist"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53368a47e38700bd8300030d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FORMATTING","FUNDAMENTALS","ALGORITHMS"]},"source":"ae5dc2ec4f03f9e5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8dde6031964dc28f.json b/allure-report/data/test-cases/aea343086c8abd68.json similarity index 54% rename from allure-report/data/test-cases/8dde6031964dc28f.json rename to allure-report/data/test-cases/aea343086c8abd68.json index 5e7d457253a..558b9c12f27 100644 --- a/allure-report/data/test-cases/8dde6031964dc28f.json +++ b/allure-report/data/test-cases/aea343086c8abd68.json @@ -1 +1 @@ -{"uid":"8dde6031964dc28f","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1732428193941,"stop":1732428193942,"duration":1},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1732428193941,"stop":1732428193941,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1732428193943,"stop":1732428193943,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"73a56012085cbb67","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"815ff7102e2d18bc","status":"passed","time":{"start":1724733472343,"stop":1724733472343,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"b1d54b76165521a0","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}},{"uid":"164087ecc666d9a0","status":"passed","time":{"start":1724735127188,"stop":1724735127188,"duration":0}}]},"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"8dde6031964dc28f.json","parameterValues":[]} \ No newline at end of file +{"uid":"aea343086c8abd68","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1732428193941,"stop":1732428193942,"duration":1},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1732428193941,"stop":1732428193941,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1732428193942,"stop":1732428193942,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1732428193943,"stop":1732428193943,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"aea343086c8abd68.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/aec2fb642901e92.json b/allure-report/data/test-cases/aec2fb642901e92.json new file mode 100644 index 00000000000..3c607c26a11 --- /dev/null +++ b/allure-report/data/test-cases/aec2fb642901e92.json @@ -0,0 +1 @@ +{"uid":"aec2fb642901e92","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied\n by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied\n by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1732428193903,"stop":1732428193903,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"tag","value":"VALIDATION"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"aec2fb642901e92.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f6fab27b83e3ab13.json b/allure-report/data/test-cases/af99dc37dcb7799b.json similarity index 75% rename from allure-report/data/test-cases/f6fab27b83e3ab13.json rename to allure-report/data/test-cases/af99dc37dcb7799b.json index 7e3014ec55a..85aba7027ce 100644 --- a/allure-report/data/test-cases/f6fab27b83e3ab13.json +++ b/allure-report/data/test-cases/af99dc37dcb7799b.json @@ -1 +1 @@ -{"uid":"f6fab27b83e3ab13","name":"Testing check_for_factor function: positive flow","fullName":"kyu_8.grasshopper_check_for_factor.test_check_for_factor.CheckForFactorTestCase#test_check_for_factor_true","historyId":"c8ef830d4279bee02e53bf3a04349c35","time":{"start":1724735129492,"stop":1724735129492,"duration":0},"description":"\n Testing check_for_factor function.\n\n This function should test if the\n factor is a factor of base.\n\n Return true if it is a factor.\n :return:\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1732428194134,"stop":1732428194134,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ddd928ac3a4fb635","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}},{"uid":"f1d39787f3312e8b","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"d558fd9b3bcee4ae","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}},{"uid":"6ce4bba2ff4664c2","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"ac136a3215f7ad6c.json","parameterValues":[]} \ No newline at end of file +{"uid":"afca78445b5fa23f","name":"Testing Battle method","fullName":"kyu_4.the_greatest_warrior.test_battle.BattleTestCase#test_battle","historyId":"8e87d116e1cdd640cae9c4bfd3a15981","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1732428194132,"stop":1732428194132,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1732428194134,"stop":1732428194134,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"afca78445b5fa23f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5fd184f18d9496f9.json b/allure-report/data/test-cases/afe0c9a0972467a3.json similarity index 71% rename from allure-report/data/test-cases/5fd184f18d9496f9.json rename to allure-report/data/test-cases/afe0c9a0972467a3.json index 4878057489a..827e3fd6bb6 100644 --- a/allure-report/data/test-cases/5fd184f18d9496f9.json +++ b/allure-report/data/test-cases/afe0c9a0972467a3.json @@ -1 +1 @@ -{"uid":"5fd184f18d9496f9","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1724735128914,"stop":1724735128930,"duration":16},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1f33a24130d10b19","name":"stdout","source":"1f33a24130d10b19.txt","type":"text/plain","size":243}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724735128930,"stop":1724735128930,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"5fd184f18d9496f9.json","parameterValues":[]} \ No newline at end of file +{"uid":"afe0c9a0972467a3","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1724735128914,"stop":1724735128930,"duration":16},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724735128914,"stop":1724735128914,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"a2484027e285a197","name":"stdout","source":"a2484027e285a197.txt","type":"text/plain","size":243}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724735128930,"stop":1724735128930,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"afe0c9a0972467a3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b02a54a0a8bd8284.json b/allure-report/data/test-cases/b02a54a0a8bd8284.json new file mode 100644 index 00000000000..e9064ba93fb --- /dev/null +++ b/allure-report/data/test-cases/b02a54a0a8bd8284.json @@ -0,0 +1 @@ +{"uid":"b02a54a0a8bd8284","name":"Testing hoop_count function (negative test case)","fullName":"kyu_8.keep_up_the_hoop.test_hoop_count.HoopCountTestCase#test_hoop_count_negative","historyId":"89ee625343ed07ab852f830d9cc358b3","time":{"start":1732764221093,"stop":1732764221093,"duration":0},"description":"\n Testing hoop_count function (negative)\n :return:\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1732428194017,"stop":1732428194017,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Snail"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ede6b0c38e1de853","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}},{"uid":"35836d979e37575","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"95ddc175910ea52","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}},{"uid":"16026a681cee6bae","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}}]},"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"461527a27e50c04a.json","parameterValues":[]} \ No newline at end of file +{"uid":"b054542ab329d2ac","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732428194015,"stop":1732428194015,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1732428194017,"stop":1732428194017,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Snail"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"b054542ab329d2ac.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/35f08e300f5635d6.json b/allure-report/data/test-cases/b0a6327af7d064cf.json similarity index 56% rename from allure-report/data/test-cases/35f08e300f5635d6.json rename to allure-report/data/test-cases/b0a6327af7d064cf.json index 00ca86acc3d..3d35092a139 100644 --- a/allure-report/data/test-cases/35f08e300f5635d6.json +++ b/allure-report/data/test-cases/b0a6327af7d064cf.json @@ -1 +1 @@ -{"uid":"35f08e300f5635d6","name":"Testing 'count_sheeps' function: mixed list","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_mixed_list","historyId":"1b4dd61e36f8ec4ee2f83635d4e16e21","time":{"start":1732428196147,"stop":1732428196148,"duration":1},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like mixed list\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1732428194154,"stop":1732428194154,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":30,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1732428194156,"stop":1732428194156,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"VALIDATION"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"b0df4a2c5fe59a12.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b1056dd0bc1f2f4e.json b/allure-report/data/test-cases/b1056dd0bc1f2f4e.json new file mode 100644 index 00000000000..325f82265dd --- /dev/null +++ b/allure-report/data/test-cases/b1056dd0bc1f2f4e.json @@ -0,0 +1 @@ +{"uid":"b1056dd0bc1f2f4e","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1732764220467,"stop":1732764220468,"duration":1},"description":"\n Testing calc_combinations_per_row function\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc_combinations_per_row function\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1732764220467,"stop":1732764220467,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732764220480,"stop":1732764220480,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"7 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Math"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cad7274be200bf39","status":"passed","time":{"start":1732428195776,"stop":1732428195776,"duration":0}},{"uid":"b7107b1da849121a","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}},{"uid":"681eea057133a7e0","status":"passed","time":{"start":1724733474210,"stop":1724733474210,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"de0aa71757f8badf","status":"passed","time":{"start":1732428195776,"stop":1732428195776,"duration":0}},{"uid":"5a941d3b90762a67","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}},{"uid":"5ef0ca25b0e8e9c5","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"b1056dd0bc1f2f4e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b1cbd478c753b1e.json b/allure-report/data/test-cases/b1cbd478c753b1e.json deleted file mode 100644 index abcfc9ee83d..00000000000 --- a/allure-report/data/test-cases/b1cbd478c753b1e.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"b1cbd478c753b1e","name":"Wolf at the beginning of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_at_start","historyId":"dcabd02011959f0337d9098678ad990d","time":{"start":1732428196468,"stop":1732428196468,"duration":0},"description":"\n If the wolf is the closest animal to you,\n return \"Pls go away and stop eating my sheep\".\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing easy_diagonal function\n :param self:\n :return:\n ","descriptionHtml":"We want to calculate the sum of the binomial coefficients on a given diagonal. The sum on diagonal 0 is 8 (we'll write it S(7, 0), 7 is the number of the line where we start, 0 is the number of the diagonal). In the same way S(7, 1) is 28, S(7, 2) is 56.
","status":"passed","steps":[{"name":"Enter n: 7, p: 0 and assert the expected: 8 vs result: 8","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 1 and assert the expected: 28 vs result: 28","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 7, p: 2 and assert the expected: 56 vs result: 56","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 3 and assert the expected: 5985 vs result: 5985","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 100, p: 0 and assert the expected: 101 vs result: 101","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 4 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 20, p: 15 and assert the expected: 20349 vs result: 20349","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 1291, p: 5 and assert the expected: 6385476296235036 vs result: 6385476296235036","time":{"start":1724735128094,"stop":1724735128094,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter n: 129100, p: 5 and assert the expected: 6429758786797926366807779220 vs result: 6429758786797926366807779220","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e11dfdc5beea1549","name":"stdout","source":"e11dfdc5beea1549.txt","type":"text/plain","size":524}],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyDiagonalTestCase::0","time":{"start":1724735128742,"stop":1724735128742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Diagonal"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.easy_diagonal.test_diagonal"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/559b8e46fa060b2c6a0000bf/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ALGORITHMS"]},"source":"b1f2cc8e1be032d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b22afbc33030e55f.json b/allure-report/data/test-cases/b22afbc33030e55f.json new file mode 100644 index 00000000000..252da807cb9 --- /dev/null +++ b/allure-report/data/test-cases/b22afbc33030e55f.json @@ -0,0 +1 @@ +{"uid":"b22afbc33030e55f","name":"Testing the 'find_missing_number' function","fullName":"kyu_6.number_zoo_patrol.test_find_missing_number.FindMissingNumberTestCase#test_find_missing_number","historyId":"ec5359964a6a6bc7051957eec5d9455d","time":{"start":1732764220226,"stop":1732764220226,"duration":0},"description":"\n Test a function that should take a shuffled list of\n unique numbers from 1 to n with one element missing\n (which can be any number including n). Should return\n this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1732764220225,"stop":1732764220225,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function that should take a shuffled list of\n unique numbers from 1 to n with one element missing\n (which can be any number including n). Should return\n this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1732764220226,"stop":1732764220226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1732764220226,"stop":1732764220226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1732764220226,"stop":1732764220226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1732764220226,"stop":1732764220226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1732764220226,"stop":1732764220226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1732764220228,"stop":1732764220228,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Number Zoo Patrol"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"PERFORMANCE"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1b7657273f039658","status":"passed","time":{"start":1732428195544,"stop":1732428195544,"duration":0}},{"uid":"ccb7c5007831ab45","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}},{"uid":"3460c7a02debe899","status":"passed","time":{"start":1724733473991,"stop":1724733473991,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"e051944b31d54c14","status":"passed","time":{"start":1732428195544,"stop":1732428195544,"duration":0}},{"uid":"3cf8d83dbb2d66b5","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}},{"uid":"f0e71551541527fc","status":"passed","time":{"start":1724735128836,"stop":1724735128852,"duration":16}}]},"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"b22afbc33030e55f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b26a6745cd367097.json b/allure-report/data/test-cases/b26a6745cd367097.json new file mode 100644 index 00000000000..77dd57a1815 --- /dev/null +++ b/allure-report/data/test-cases/b26a6745cd367097.json @@ -0,0 +1 @@ +{"uid":"b26a6745cd367097","name":"Testing check_for_factor function: positive flow","fullName":"kyu_8.grasshopper_check_for_factor.test_check_for_factor.CheckForFactorTestCase#test_check_for_factor_true","historyId":"c8ef830d4279bee02e53bf3a04349c35","time":{"start":1732764220981,"stop":1732764220981,"duration":0},"description":"\n Testing check_for_factor function.\n\n This function should test if the\n factor is a factor of base.\n\n Return true if it is a factor.\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"5f2df3f2c9b86d77.json","parameterValues":[]} \ No newline at end of file +{"uid":"b3ade822e686b250","name":"Testing shark function (negative)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_bait","historyId":"83b78a44a84315eae8c56a708925a03e","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> negative\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"b3ade822e686b250.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8b3214317e10e87f.json b/allure-report/data/test-cases/b3d5b9d863751a3f.json similarity index 58% rename from allure-report/data/test-cases/8b3214317e10e87f.json rename to allure-report/data/test-cases/b3d5b9d863751a3f.json index 3bd3f59298b..453f7a4ba2f 100644 --- a/allure-report/data/test-cases/8b3214317e10e87f.json +++ b/allure-report/data/test-cases/b3d5b9d863751a3f.json @@ -1 +1 @@ -{"uid":"8b3214317e10e87f","name":"Testing number_of_sigfigs function","fullName":"kyu_7.significant_figures.test_number_of_sigfigs.NumberOfSigFigsTestCase#test_number_of_sigfigs","historyId":"3b2ebb1924dbc4e6a73dc5dda19dd323","time":{"start":1732428195953,"stop":1732428195953,"duration":0},"description":"\n Testing number_of_sigfigs function\n with various test inputs\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428194244,"stop":1732428194248,"duration":4},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"58e0261647deccd2","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}},{"uid":"dc1f8d6367d3e66e","status":"passed","time":{"start":1724733472624,"stop":1724733472765,"duration":141}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"9cb8749ab5d5d5c7","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}},{"uid":"2ed8dfd7ca5a3d13","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}}]},"tags":["ALGORITHMS"]},"source":"f727d28e098b30b7.json","parameterValues":[]} \ No newline at end of file +{"uid":"b3fa4d42fb1064a9","name":"Testing advice function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_first_non_repeating_letter","historyId":"dc079813fc553d210a3def6568230a25","time":{"start":1732428194244,"stop":1732428194248,"duration":4},"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732428194231,"stop":1732428194231,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428194244,"stop":1732428194248,"duration":4},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732428194255,"stop":1732428194255,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"story","value":"Find the safest places in town"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"b3fa4d42fb1064a9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b4abfaf3d77f3f23.json b/allure-report/data/test-cases/b4abfaf3d77f3f23.json deleted file mode 100644 index 1401be85d1b..00000000000 --- a/allure-report/data/test-cases/b4abfaf3d77f3f23.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"b4abfaf3d77f3f23","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a881d3345681241e","name":"stdout","source":"a881d3345681241e.txt","type":"text/plain","size":931}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1724733472999,"stop":1724733472999,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MEMOIZATION"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"b4abfaf3d77f3f23.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b4bcf3d5a4367d8.json b/allure-report/data/test-cases/b4bcf3d5a4367d8.json new file mode 100644 index 00000000000..d591ab96dbe --- /dev/null +++ b/allure-report/data/test-cases/b4bcf3d5a4367d8.json @@ -0,0 +1 @@ +{"uid":"b4bcf3d5a4367d8","name":"Testing first_non_repeated function with various inputs","fullName":"kyu_7.the_first_non_repeated_character_in_string.test_first_non_repeated.FirstNonRepeatedTestCase#test_first_non_repeated","historyId":"9398abf0c9f75b70331fc87dcc2b8a7f","time":{"start":1724735129336,"stop":1724735129336,"duration":0},"description":"\n Testing first_non_repeated function\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1732428194291,"stop":1732428194291,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194324,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194324,"stop":1732428194391,"duration":67},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data and verify the output...","time":{"start":1732428194391,"stop":1732428194424,"duration":33},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1732428194434,"stop":1732428194434,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Integers: Recreation One"},{"name":"tag","value":"OPTIMIZATION"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7da87d8449dbfb8b","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}},{"uid":"87c07388b10e55d5","status":"passed","time":{"start":1724733472796,"stop":1724733472921,"duration":125}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"7fd5632b0213855d","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}},{"uid":"60f5877935ced5c5","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}}]},"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"7560669431ea4aa8.json","parameterValues":[]} \ No newline at end of file +{"uid":"b540357a03b90416","name":"Testing list_squared function","fullName":"kyu_5.integers_recreation_one.test_list_squared.ListSquaredTestCase#test_flatten","historyId":"59de8dec543be1db3938897a3c9169de","time":{"start":1732428194292,"stop":1732428194424,"duration":132},"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1732428194291,"stop":1732428194291,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194292,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732428194292,"stop":1732428194324,"duration":32},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732428194324,"stop":1732428194391,"duration":67},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732428194391,"stop":1732428194424,"duration":33},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1732428194434,"stop":1732428194434,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Integers: Recreation One"},{"name":"tag","value":"OPTIMIZATION"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Optimization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"b540357a03b90416.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/64c2df72a296b62e.json b/allure-report/data/test-cases/b5cedd1e00782e11.json similarity index 73% rename from allure-report/data/test-cases/64c2df72a296b62e.json rename to allure-report/data/test-cases/b5cedd1e00782e11.json index 7c0b8cf6052..01f0b06e5fb 100644 --- a/allure-report/data/test-cases/64c2df72a296b62e.json +++ b/allure-report/data/test-cases/b5cedd1e00782e11.json @@ -1 +1 @@ -{"uid":"64c2df72a296b62e","name":"Testing 'has_subpattern' (part 2) function","fullName":"kyu_6.string_subpattern_recognition_2.test_has_subpattern.HasSubpatternTestCase#test_has_subpattern","historyId":"3086879b276d25b4dd0f45ada5d9f20b","time":{"start":1724735128930,"stop":1724735128946,"duration":16},"description":"\n Verify that 'has_subpattern' function to returns\n either true/True or false/False if a string can be\n seen as the repetition of a simpler/shorter subpattern or not.\n\n 1. if a subpattern has been used, it will be repeated\n at least twice, meaning the subpattern has to be\n shorter than the original string;\n\n 2. the strings you will be given might or might not\n be created repeating a given subpattern, then\n shuffling the result.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732764218886,"stop":1732764218886,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named advice(agents, n) where:\n - agents is an array of agent coordinates.\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should return a list of coordinates that are the furthest\n away (by Manhattan distance) from all agents.\n :return:\n ","descriptionHtml":"The function should return a list of coordinates that are the furthest away (by Manhattan distance) from all agents.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732764218894,"stop":1732764218908,"duration":14},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732764218912,"stop":1732764218912,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Find the safest places in town"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b3fa4d42fb1064a9","status":"passed","time":{"start":1732428194244,"stop":1732428194248,"duration":4}},{"uid":"994a4ad6b5f0c1e0","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}},{"uid":"4f20da98ae3e1985","status":"passed","time":{"start":1724733472624,"stop":1724733472765,"duration":141}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"f727d28e098b30b7","status":"passed","time":{"start":1732428194244,"stop":1732428194248,"duration":4}},{"uid":"9cb8749ab5d5d5c7","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}},{"uid":"2ed8dfd7ca5a3d13","status":"passed","time":{"start":1724735127531,"stop":1724735127656,"duration":125}}]},"tags":["ALGORITHMS"]},"source":"b684b0c7250ecf6d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c94aec0d920b7f7d.json b/allure-report/data/test-cases/b7107b1da849121a.json similarity index 61% rename from allure-report/data/test-cases/c94aec0d920b7f7d.json rename to allure-report/data/test-cases/b7107b1da849121a.json index b0a9747c58d..3c79295116a 100644 --- a/allure-report/data/test-cases/c94aec0d920b7f7d.json +++ b/allure-report/data/test-cases/b7107b1da849121a.json @@ -1 +1 @@ -{"uid":"c94aec0d920b7f7d","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4e248e61461ec35c","name":"stdout","source":"4e248e61461ec35c.txt","type":"text/plain","size":304}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"c94aec0d920b7f7d.json","parameterValues":[]} \ No newline at end of file +{"uid":"b7107b1da849121a","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1724735129055,"stop":1724735129055,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f9be06237574ec64","name":"stdout","source":"f9be06237574ec64.txt","type":"text/plain","size":304}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724735129071,"stop":1724735129071,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"b7107b1da849121a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2e9a9a4090c00445.json b/allure-report/data/test-cases/b7108f3053cbc60d.json similarity index 72% rename from allure-report/data/test-cases/2e9a9a4090c00445.json rename to allure-report/data/test-cases/b7108f3053cbc60d.json index 700dfd7cf67..970cd049d20 100644 --- a/allure-report/data/test-cases/2e9a9a4090c00445.json +++ b/allure-report/data/test-cases/b7108f3053cbc60d.json @@ -1 +1 @@ -{"uid":"2e9a9a4090c00445","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"9cd8266cfd985687","name":"stdout","source":"9cd8266cfd985687.txt","type":"text/plain","size":1013}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"story","value":"Row of the odd triangle"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"2e9a9a4090c00445.json","parameterValues":[]} \ No newline at end of file +{"uid":"b7108f3053cbc60d","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2b123edd90aa8cfa","name":"stdout","source":"2b123edd90aa8cfa.txt","type":"text/plain","size":1013}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PERFORMANCE"},{"name":"tag","value":"ALGORITHMS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"story","value":"Row of the odd triangle"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"b7108f3053cbc60d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ede6b0c38e1de853.json b/allure-report/data/test-cases/b7874e896ca052d2.json similarity index 68% rename from allure-report/data/test-cases/ede6b0c38e1de853.json rename to allure-report/data/test-cases/b7874e896ca052d2.json index ca3ac6aa531..00704ebd6d5 100644 --- a/allure-report/data/test-cases/ede6b0c38e1de853.json +++ b/allure-report/data/test-cases/b7874e896ca052d2.json @@ -1 +1 @@ -{"uid":"ede6b0c38e1de853","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"21cec5980af4ec14","name":"stdout","source":"21cec5980af4ec14.txt","type":"text/plain","size":1009}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Snail"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"ede6b0c38e1de853.json","parameterValues":[]} \ No newline at end of file +{"uid":"b7874e896ca052d2","name":"Testing 'snail' function","fullName":"kyu_4.snail.test_snail.SnailTestCase#test_snail","historyId":"464e445546d6c625c166d17d836fe45c","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"cff9f69ec70ee0f7","name":"stdout","source":"cff9f69ec70ee0f7.txt","type":"text/plain","size":1009}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1724735127266,"stop":1724735127266,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"story","value":"Snail"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"b7874e896ca052d2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b78b9d24e53cd100.json b/allure-report/data/test-cases/b78b9d24e53cd100.json new file mode 100644 index 00000000000..3d82256c5f2 --- /dev/null +++ b/allure-report/data/test-cases/b78b9d24e53cd100.json @@ -0,0 +1 @@ +{"uid":"b78b9d24e53cd100","name":"Testing 'sum_triangular_numbers' with negative numbers","fullName":"kyu_7.sum_of_triangular_numbers.test_sum_triangular_numbers.SumTriangularNumbersTestCase#test_sum_triangular_numbers_negative_numbers","historyId":"4e553d5e3ff5fc5c21a746a843af96e5","time":{"start":1732764220737,"stop":1732764220737,"duration":0},"description":"\n Testing 'sum_triangular_numbers' function\n with negative numbers\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase","time":{"start":1732764218952,"stop":1732764218953,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing list_squared function\n\n :return:\n ","descriptionHtml":"Given two integers m, n (1 <= m <= n) we want to find all integers between m and n whose sum of squared divisors is itself a square.
","status":"passed","steps":[{"name":"Enter test data and verify the output...","time":{"start":1732764218953,"stop":1732764218953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732764218953,"stop":1732764218953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732764218953,"stop":1732764218953,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732764218953,"stop":1732764219003,"duration":50},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732764219003,"stop":1732764219071,"duration":68},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data and verify the output...","time":{"start":1732764219071,"stop":1732764219098,"duration":27},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ListSquaredTestCase::0","time":{"start":1732764219110,"stop":1732764219110,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Integers: Recreation One"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"OPTIMIZATION"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Optimization"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.integers_recreation_one.test_list_squared"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55aa075506463dac6600010d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b540357a03b90416","status":"passed","time":{"start":1732428194292,"stop":1732428194424,"duration":132}},{"uid":"61de742601660eab","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}},{"uid":"319c2fc51c0b8912","status":"passed","time":{"start":1724733472796,"stop":1724733472921,"duration":125}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"7560669431ea4aa8","status":"passed","time":{"start":1732428194292,"stop":1732428194424,"duration":132}},{"uid":"7fd5632b0213855d","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}},{"uid":"60f5877935ced5c5","status":"passed","time":{"start":1724735127688,"stop":1724735127813,"duration":125}}]},"tags":["FUNDAMENTALS","OPTIMIZATION","ALGORITHMS","ARRAYS"]},"source":"b7dd8f8438e567a9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/b897401968bf0d8.json b/allure-report/data/test-cases/b897401968bf0d8.json deleted file mode 100644 index 8513cf733b6..00000000000 --- a/allure-report/data/test-cases/b897401968bf0d8.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"b897401968bf0d8","name":"Zero","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_zero","historyId":"e47953912bc73286c8a01ce448ee3c54","time":{"start":1732428196084,"stop":1732428196084,"duration":0},"description":"\n 0 is a square number\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"48abcc67292a5aa2.json","parameterValues":[]} \ No newline at end of file +{"uid":"b8bd7a062c96fe90","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735129524,"stop":1724735129524,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"b8bd7a062c96fe90.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3ee1470ea7ce07a6.json b/allure-report/data/test-cases/b8f5ce56991bbe59.json similarity index 68% rename from allure-report/data/test-cases/3ee1470ea7ce07a6.json rename to allure-report/data/test-cases/b8f5ce56991bbe59.json index c8bb764aa71..c766e7155e6 100644 --- a/allure-report/data/test-cases/3ee1470ea7ce07a6.json +++ b/allure-report/data/test-cases/b8f5ce56991bbe59.json @@ -1 +1 @@ -{"uid":"3ee1470ea7ce07a6","name":"Should return 'I smell a series!'","fullName":"kyu_8.well_of_ideas_easy_version.test_well_of_ideas_easy_version.WellTestCase#test_well_series","historyId":"fd37424f9957f0d1afe768cce5a8cc08","time":{"start":1724733474960,"stop":1724733474960,"duration":0},"description":"\n if there are more than 2 return\n 'I smell a series!'.\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"3a4387d961fd6fe2","name":"stdout","source":"3a4387d961fd6fe2.txt","type":"text/plain","size":676}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LOOPS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"54043a9fba80789b.json","parameterValues":[]} \ No newline at end of file +{"uid":"b9086c98d6d71504","name":"Testing done_or_not function","fullName":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku.DidIFinishedSudokuTestCase#test_done_or_not","historyId":"7c59feaf54bd4089e056f041844e3fe6","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"30ae8f4eae56e738","name":"stdout","source":"30ae8f4eae56e738.txt","type":"text/plain","size":676}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1724733472561,"stop":1724733472561,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"LOOPS"},{"name":"feature","value":"Control Flow"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"b9086c98d6d71504.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a349732eb44f62b9.json b/allure-report/data/test-cases/b98e581eac70f265.json similarity index 60% rename from allure-report/data/test-cases/a349732eb44f62b9.json rename to allure-report/data/test-cases/b98e581eac70f265.json index 5ae1056b924..96390711a75 100644 --- a/allure-report/data/test-cases/a349732eb44f62b9.json +++ b/allure-report/data/test-cases/b98e581eac70f265.json @@ -1 +1 @@ -{"uid":"a349732eb44f62b9","name":"Testing 'solution' function","fullName":"kyu_7.substituting_variables_into_strings_padded_numbers.test_solution.SolutionTestCase#test_solution","historyId":"fbdd2daae3e9a5e6dd05fcb0403a88d1","time":{"start":1732428195982,"stop":1732428195982,"duration":0},"description":"\n The function should return a formatted string.\n The return value should equal \"Value is VALUE\"\n where value is a 5 digit padded number.\n :return:\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1dc0d1d2e3a97f3c","name":"stdout","source":"1dc0d1d2e3a97f3c.txt","type":"text/plain","size":67}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"3d13030ecd2583e8.json","parameterValues":[]} \ No newline at end of file +{"uid":"ba3e30be8784f086","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"78d708b30903548d","name":"stdout","source":"78d708b30903548d.txt","type":"text/plain","size":67}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1724733472530,"stop":1724733472530,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"The Greatest Warrior"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"RULES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"ba3e30be8784f086.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ba71f124345447fc.json b/allure-report/data/test-cases/ba71f124345447fc.json new file mode 100644 index 00000000000..804db1681b3 --- /dev/null +++ b/allure-report/data/test-cases/ba71f124345447fc.json @@ -0,0 +1 @@ +{"uid":"ba71f124345447fc","name":"Testing check_root function","fullName":"kyu_7.always_perfect.test_check_root.CheckRootTestCase#test_check_root","historyId":"9c2d30046a2fe35ee19c9d3833ea20a5","time":{"start":1732764220417,"stop":1732764220418,"duration":1},"description":"\n Testing check_root function with various test inputs\n\n A function which takes numbers separated by commas\n in string format and returns the number which is a\n perfect square and the square root of that number.\n\n If string contains other characters than number or\n it has more or less than 4 numbers separated by comma\n function returns \"incorrect input\".\n\n If string contains 4 numbers but not consecutive it\n returns \"not consecutive\".\n :return:\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5c2711b7e4875740","name":"stdout","source":"5c2711b7e4875740.txt","type":"text/plain","size":1904}],"parameters":[],"hasContent":true,"stepsCount":21,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"PARSING STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"57e5e5f4d9d91cf6.json","parameterValues":[]} \ No newline at end of file +{"uid":"bae98e899f1ebab4","name":"Testing calc function","fullName":"kyu_2.evaluate_mathematical_expression.test_evaluate.CalcTestCase#test_calc","historyId":"f2e69721b9f301c2454fa419ac365031","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc class\n\n Given a mathematical expression as a string you\n must return the result as a number.\n ","descriptionHtml":"Given a mathematical expression as a string you must return the result as a number.
","status":"passed","steps":[{"name":"Enter a test string (1 + 1), calculate the result (2.0) and compare vs expected (2)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (8/16), calculate the result (0.5) and compare vs expected (0.5)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 -(-1)), calculate the result (4.0) and compare vs expected (4)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + -2), calculate the result (0.0) and compare vs expected (0)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (10- 2- -5), calculate the result (13.0) and compare vs expected (13)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((10)))), calculate the result (10.0) and compare vs expected (10)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (3 * 5), calculate the result (15.0) and compare vs expected (15)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-7 * -(6 / 3)), calculate the result (14.0) and compare vs expected (14)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (2 + 3 * 4 / 3 - 6 / 3 * 3 + 8), calculate the result (8.0) and compare vs expected (8)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * 3 - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (1 + 2 * 3 * (5 - (3 - 1)) - 8), calculate the result (11.0) and compare vs expected (11)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-(-(-1)))), calculate the result (1.0) and compare vs expected (1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((((((-1)))))), calculate the result (-1.0) and compare vs expected (-1)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (58 / 40 - -45 * 13 * 35 - -19 / -71 + 60), calculate the result (20536.1823943662) and compare vs expected (20536.1823943662)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (61 + 82 + -81 - -53 * 84 - -83 + -74 / 60), calculate the result (4595.766666666666) and compare vs expected (4595.766666666666)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(94) * (36 / 64 + -(13)) - (41 - (((-(-15 - 58)))) - -23)), calculate the result (1178.125) and compare vs expected (1178.125)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-91) - (92 - -2 / -(13)) / (-42 - -(((-(-90 - 30)))) * -53)), calculate the result (91.014346478264) and compare vs expected (91.014346478264)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-93) / (-36 + 26 + -(18)) + (-7 * -(((-(-67 + -95)))) + -9)), calculate the result (1121.6785714285713) and compare vs expected (1121.6785714285713)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(-23) + (-4 * -13 + -(1)) - (-30 / (((-(57 + -20)))) + 85)), calculate the result (-11.810810810810807) and compare vs expected (-11.810810810810807)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string ((72) / (-82 - -93 * -(88)) + (-18 - -(((-(60 * 97)))) + -79)), calculate the result (-5917.00871037987) and compare vs expected (-5917.00871037987)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (-(77) / (7 * -76 + (59)) + (98 / -(((-(-74 - -47)))) / -5)), calculate the result (0.8887166236003445) and compare vs expected (0.8887166236003445)","time":{"start":1724733472280,"stop":1724733472280,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"55397a95b3056409","name":"stdout","source":"55397a95b3056409.txt","type":"text/plain","size":1904}],"parameters":[],"stepsCount":21,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalcTestCase::0","time":{"start":1724733472296,"stop":1724733472296,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"parentSuite","value":"Proficient"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"OPERATORS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"EXPRESSIONS"},{"name":"story","value":"Evaluate mathematical expression"},{"name":"epic","value":"2 kyu"},{"name":"tag","value":"PARSING STRINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_2.evaluate_mathematical_expression.test_evaluate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52a78825cdfc2cfc87000005/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","EXPRESSIONS","FUNDAMENTALS","NUMBERS","BASIC LANGUAGE FEATURES","ALGORITHMS","OPERATORS","PARSING STRINGS"]},"source":"bae98e899f1ebab4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/baf923b3ced2f0a.json b/allure-report/data/test-cases/baf923b3ced2f0a.json new file mode 100644 index 00000000000..8f5c33b95a3 --- /dev/null +++ b/allure-report/data/test-cases/baf923b3ced2f0a.json @@ -0,0 +1 @@ +{"uid":"baf923b3ced2f0a","name":"Testing to_alternating_case function","fullName":"kyu_8.alternating_case.test_alternating_case.AlternatingCaseTestCase#test_alternating_case","historyId":"470b5bb32c448e7433bb94b222d4d8b0","time":{"start":1732428196092,"stop":1732428196092,"duration":0},"description":"\n Testing to_alternating_case function\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1732764218886,"stop":1732764218886,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732764218887,"stop":1732764218887,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1732764218912,"stop":1732764218912,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Find the safest places in town"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"71a87e59b6648413","status":"passed","time":{"start":1732428194232,"stop":1732428194233,"duration":1}},{"uid":"d64758690dcdce52","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"641fd537e33a59ae","status":"passed","time":{"start":1724733472624,"stop":1724733472624,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"5cd4eeb8a4b79d6b","status":"passed","time":{"start":1732428194232,"stop":1732428194233,"duration":1}},{"uid":"645c6c05562d2f01","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}},{"uid":"34569132e9551c33","status":"passed","time":{"start":1724735127516,"stop":1724735127516,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"bb0cb59f0e1a4eca.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/6076e8e1aaaa11ab.json b/allure-report/data/test-cases/bb6e602a844f0715.json similarity index 59% rename from allure-report/data/test-cases/6076e8e1aaaa11ab.json rename to allure-report/data/test-cases/bb6e602a844f0715.json index 259f54af06b..82ead165c25 100644 --- a/allure-report/data/test-cases/6076e8e1aaaa11ab.json +++ b/allure-report/data/test-cases/bb6e602a844f0715.json @@ -1 +1 @@ -{"uid":"6076e8e1aaaa11ab","name":"Testing pig_it function","fullName":"kyu_5.simple_pig_latin.test_pig_it.PigItTestCase#test_pig_it","historyId":"c5f1cfe64ff8d3a4f16a4166c571797e","time":{"start":1732428194488,"stop":1732428194489,"duration":1},"description":"\n Testing pig_it function\n\n The function should mpve the first letter of each\n word to the end of it, then add \"ay\" to the end\n of the word. Leave punctuation marks untouched.\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing odd_row function with various test data\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1732428195618,"stop":1732428195618,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Row of the odd triangle"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"tag","value":"PERFORMANCE"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e378762a5dac9d1e","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}},{"uid":"2e9a9a4090c00445","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"9b82a842fdc9b867","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}},{"uid":"4c3877c30e625752","status":"passed","time":{"start":1724735128914,"stop":1724735128914,"duration":0}}]},"tags":["PERFORMANCE","ALGORITHMS"]},"source":"59b1922c33f3ac65.json","parameterValues":[]} \ No newline at end of file +{"uid":"bb7d4237e3a80dd7","name":"Testing odd_row function","fullName":"kyu_6.row_of_the_odd_triangle.test_odd_row.OddRowTestCase#test_odd_row","historyId":"6738a51245363d65952509f12ebc1af8","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"description":"\n Testing odd_row function with various test data\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing odd_row function with various test data\n :return:\n ","descriptionHtml":"Given a triangle of consecutive odd numbers find the triangle's row knowing its index (the rows are 1-indexed)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output ([1]) vs actual result ([1])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output ([3, 5]) vs actual result ([3, 5])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181]) vs actual result ([157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379]) vs actual result ([343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721]) vs actual result ([1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1721])","time":{"start":1732428195616,"stop":1732428195616,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1732428195618,"stop":1732428195618,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Row of the odd triangle"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"tag","value":"PERFORMANCE"},{"name":"suite","value":"Performance"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.row_of_the_odd_triangle.test_odd_row"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5d5a7525207a674b71aa25b5","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["PERFORMANCE","ALGORITHMS"]},"source":"bb7d4237e3a80dd7.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7d6c6bb6b47e11d4.json b/allure-report/data/test-cases/bc6803e227b56151.json similarity index 58% rename from allure-report/data/test-cases/7d6c6bb6b47e11d4.json rename to allure-report/data/test-cases/bc6803e227b56151.json index 76293d6d2fb..c6d3678fbf3 100644 --- a/allure-report/data/test-cases/7d6c6bb6b47e11d4.json +++ b/allure-report/data/test-cases/bc6803e227b56151.json @@ -1 +1 @@ -{"uid":"7d6c6bb6b47e11d4","name":"Testing toJadenCase function (positive)","fullName":"kyu_7.jaden_casing_strings.test_jaden_casing_strings.JadenCasingStringsTestCase#test_to_jaden_case_positive","historyId":"7c48f5c6aa887d1bc76d081b028cf7cf","time":{"start":1732428195874,"stop":1732428195875,"duration":1},"description":"\n Simple positive test\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"5b3fc84157197066.json","parameterValues":[]} \ No newline at end of file +{"uid":"bcdd15975118f527","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
sharkDistance = distance the shark needs to cover to eat you in metres,
sharkSpeed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
youSpeed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724733474741,"stop":1724733474741,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1724733474757,"stop":1724733474757,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"suite","value":"Math"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"bcdd15975118f527.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bd11ee5929c6c53a.json b/allure-report/data/test-cases/bd11ee5929c6c53a.json deleted file mode 100644 index ce5e4796cb0..00000000000 --- a/allure-report/data/test-cases/bd11ee5929c6c53a.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"bd11ee5929c6c53a","name":"Testing validate_battlefield function","fullName":"kyu_3.battleship_field_validator.test_battleship_validator.BattleshipFieldValidatorTestCase#test_validate_battlefield","historyId":"b22abb76677627273b26e5c011545fb2","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied\n by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Battleship field validator\n\n Testing a method that takes a field for well-known board game \"Battleship\"\n as an argument and returns true if it has a valid disposition of ships,\n false otherwise. Argument is guaranteed to be 10*10 two-dimension array.\n Elements in the array are numbers, 0 if the cell is free and 1 if occupied\n by ship.\n ","descriptionHtml":"Testing a method that takes a field for well-known board game \"Battleship\" as an argument and returns true if it has a valid disposition of ships, false otherwise.
","status":"passed","steps":[{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> True, actual -> True","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Field validation: expected -> False, actual -> False","time":{"start":1732428193899,"stop":1732428193899,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleshipFieldValidatorTestCase::0","time":{"start":1732428193903,"stop":1732428193903,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Battleship field validator"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"GAME BOARDS"},{"name":"feature","value":"Lists"},{"name":"tag","value":"VALIDATION"},{"name":"parentSuite","value":"Competent"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.battleship_field_validator.test_battleship_validator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/52bb6539a4cf1b12d90005b7","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"49355004a4136993","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}},{"uid":"56ae9013352b7649","status":"passed","time":{"start":1724733472296,"stop":1724733472296,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"5dad026541a05e65","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}},{"uid":"36b9e5073b489f49","status":"passed","time":{"start":1724735127157,"stop":1724735127157,"duration":0}}]},"tags":["GAME BOARDS","GAMES","VALIDATION","ALGORITHMS","ARRAYS"]},"source":"bd11ee5929c6c53a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/36b7cb5a27235272.json b/allure-report/data/test-cases/bd28741372a5f921.json similarity index 58% rename from allure-report/data/test-cases/36b7cb5a27235272.json rename to allure-report/data/test-cases/bd28741372a5f921.json index 0344fb881c6..2a2968cc012 100644 --- a/allure-report/data/test-cases/36b7cb5a27235272.json +++ b/allure-report/data/test-cases/bd28741372a5f921.json @@ -1 +1 @@ -{"uid":"36b7cb5a27235272","name":"Testing check_for_factor function: positive flow","fullName":"kyu_8.grasshopper_check_for_factor.test_check_for_factor.CheckForFactorTestCase#test_check_for_factor_true","historyId":"c8ef830d4279bee02e53bf3a04349c35","time":{"start":1732428196200,"stop":1732428196201,"duration":1},"description":"\n Testing check_for_factor function.\n\n This function should test if the\n factor is a factor of base.\n\n Return true if it is a factor.\n :return:\n ","descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"443a1d8f74495540","name":"stdout","source":"443a1d8f74495540.txt","type":"text/plain","size":117}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"f040925d9e513197.json","parameterValues":[]} \ No newline at end of file +{"uid":"bdcd06f2ac6e82c9","name":"Testing zero_fuel function","fullName":"kyu_8.will_you_make_it.test_zero_fuel.ZeroFuelTestCase#test_zero_fuel","historyId":"47e8749fb79b5ff765dc32c3b5efb2a3","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You were camping with your friends far away from home, but when it's time to go back, you realize that you fuel is running out and the nearest pump is 50 miles away! You know that on average, your car runs on about 25 miles per gallon. There are 2 gallons left. Considering these factors, write a function that tells you if it is possible to get to the pump or not. Function should return true (1 in Prolog) if it is possible and false (0 in Prolog) if not. The input values are always positive.
","status":"passed","steps":[{"name":"Enter data ((50, 25, 2)) and verify the expected output (True) vs actual result (True)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter data ((100, 50, 1)) and verify the expected output (False) vs actual result (False)","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"e07fc7bf167a48cd","name":"stdout","source":"e07fc7bf167a48cd.txt","type":"text/plain","size":117}],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ZeroFuelTestCase::0","time":{"start":1724735129742,"stop":1724735129742,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"8 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Will you make it?"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.will_you_make_it.test_zero_fuel"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5861d28f124b35723e00005e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"bdcd06f2ac6e82c9.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bdd8b1b0bd82d5b1.json b/allure-report/data/test-cases/bdd8b1b0bd82d5b1.json new file mode 100644 index 00000000000..813a9de2c11 --- /dev/null +++ b/allure-report/data/test-cases/bdd8b1b0bd82d5b1.json @@ -0,0 +1 @@ +{"uid":"bdd8b1b0bd82d5b1","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1732764218838,"stop":1732764218838,"duration":0},"description":"\n Testing using basic test data\n :return:\n ","descriptionHtml":" Testing using basic test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ee7ac80cd7bb8f8d","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194185,"stop":1732428194185,"duration":0}},{"uid":"5aa7474450de295f","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"28083507c1397923","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"a57a3497f4402b67","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428194185,"stop":1732428194185,"duration":0}},{"uid":"d6d51bdb700f78e3","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"ad08cb0fb6eef203","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"bdd8b1b0bd82d5b1.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/749e2bcfe9e98a99.json b/allure-report/data/test-cases/bded3837031681ca.json
similarity index 57%
rename from allure-report/data/test-cases/749e2bcfe9e98a99.json
rename to allure-report/data/test-cases/bded3837031681ca.json
index c30cbfe07bf..1cdb2974203 100644
--- a/allure-report/data/test-cases/749e2bcfe9e98a99.json
+++ b/allure-report/data/test-cases/bded3837031681ca.json
@@ -1 +1 @@
-{"uid":"749e2bcfe9e98a99","name":"Testing invite_more_women function (positive)","fullName":"kyu_7.simple_fun_152.test_invite_more_women.InviteMoreWomenTestCase#test_invite_more_women_positive","historyId":"d8680aad50eda2b69694580584e0455f","time":{"start":1732428195966,"stop":1732428195967,"duration":1},"description":"\n Simple Fun #152: Invite More Women?\n Testing invite_more_women function (positive)\n :return:\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test top_3_words function\n ","descriptionHtml":"Given a string of text (possibly with punctuation and line-breaks), the function should return an array of the top-3 most occurring words, in descending order of the number of occurrences.
","status":"passed","steps":[{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and verify the output","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"e9b85a28a1d1502","name":"stdout","source":"e9b85a28a1d1502.txt","type":"text/plain","size":3097}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_Top3WordsTestCase::0","time":{"start":1724733472374,"stop":1724733472374,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"PARSING"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"RANKING"},{"name":"story","value":"Most frequently used words in a text"},{"name":"feature","value":"String"},{"name":"tag","value":"FILTERING"},{"name":"parentSuite","value":"Competent"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.most_frequently_used_words.test_top_3_words"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51e056fe544cf36c410000fb/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FILTERING","PARSING","ALGORITHMS","RANKING"]},"source":"be618dffc8aac711.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2dcd793cb9c1cce4.json b/allure-report/data/test-cases/bf68fdf036dd98c9.json similarity index 73% rename from allure-report/data/test-cases/2dcd793cb9c1cce4.json rename to allure-report/data/test-cases/bf68fdf036dd98c9.json index f8ae4018de5..78351d50695 100644 --- a/allure-report/data/test-cases/2dcd793cb9c1cce4.json +++ b/allure-report/data/test-cases/bf68fdf036dd98c9.json @@ -1 +1 @@ -{"uid":"2dcd793cb9c1cce4","name":"Wolf in the middle of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_in_middle","historyId":"3de540be96edd1a6ef052fccdb3f5cad","time":{"start":1724733475007,"stop":1724733475007,"duration":0},"description":"\n If the wolf is the closest animal to you,\n return \"Pls go away and stop eating my sheep\".\n :return:\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1732428194618,"stop":1732428194618,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":9,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1732428194621,"stop":1732428194621,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Factorial"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e186c7a758de768a","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}},{"uid":"9348c64cc78f5d13","status":"passed","time":{"start":1724733473124,"stop":1724733473124,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"de04793abb90de01","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}},{"uid":"3d3e842542b066f3","status":"passed","time":{"start":1724735128016,"stop":1724735128016,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"34a84f898de954b5.json","parameterValues":[]} \ No newline at end of file +{"uid":"bf7dba429c84fe69","name":"Testing checkchoose function","fullName":"kyu_6.color_choice.test_checkchoose.CheckchooseTestCase#test_checkchoose","historyId":"2e5f294dd8fbb4489c95b8783fb8e9af","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase","time":{"start":1732428194618,"stop":1732428194618,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n In mathematics the number of x combinations you can take from a\n set of n elements is called the binomial coefficient of n and x,\n or more often n choose x. The formula to compute m = n choose x is:\n m = n! / (x! * (n - x)!) where ! is the factorial operator.\n\n You are a renowned poster designer and painter. You are asked to\n provide 6 posters all having the same design each in 2 colors.\n Posters must all have a different color combination and you have\n the choice of 4 colors: red, blue, yellow, green. How many colors\n can you choose for each poster?\n ","descriptionHtml":"Knowing m (number of posters to design), knowing n (total number of available colors), let us search x (number of colors for each poster so that each poster has a unique combination of colors and the number of combinations is exactly the same as the number of posters). In other words we must find x such as n choose x = m (1) for a given m and a given n; m >= 0 and n > 0. If many x are solutions give as result the smallest x. It can happen that when m is given at random there are no x satisfying equation (1) then return -1.
","status":"passed","steps":[{"name":"Pass m: 6, n: 4 and assert the result: 2 vs expected: 2","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 4 and assert the result: 1 vs expected: 1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 4, n: 2 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 35, n: 7 and assert the result: 3 vs expected: 3","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 36, n: 7 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 6 and assert the result: 0 vs expected: 0","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 1, n: 15 and assert the result: 0 vs expected: 0","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 2, n: 12 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Pass m: 75788358475481302186, n: 87 and assert the result: -1 vs expected: -1","time":{"start":1732428194619,"stop":1732428194619,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":9,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CheckchooseTestCase::0","time":{"start":1732428194621,"stop":1732428194621,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Factorial"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Color Choice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.color_choice.test_checkchoose"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55be10de92aad5ef28000023","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"bf7dba429c84fe69.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/acfebfd078f8e03c.json b/allure-report/data/test-cases/bfb03abe3203ecf1.json similarity index 72% rename from allure-report/data/test-cases/acfebfd078f8e03c.json rename to allure-report/data/test-cases/bfb03abe3203ecf1.json index 68835673fcc..04c45b9bc84 100644 --- a/allure-report/data/test-cases/acfebfd078f8e03c.json +++ b/allure-report/data/test-cases/bfb03abe3203ecf1.json @@ -1 +1 @@ -{"uid":"acfebfd078f8e03c","name":"Testing 'save' function: negative","fullName":"kyu_7.fill_the_hard_disk_drive.test_save.SaveTestCase#test_save_negative","historyId":"eb89ee17d2b7a29796b27ce5ba503de6","time":{"start":1724733474241,"stop":1724733474241,"duration":0},"description":"\n Testing 'save' function: negative\n\n The function should determine how many\n files of the copy queue you will be able\n to save into your Hard Disk Drive.\n :return:\n ","descriptionHtml":"Testing Battle method
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase","time":{"start":1732764218782,"stop":1732764218782,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Battle method\n ","descriptionHtml":"Testing Battle method
","status":"passed","steps":[{"name":"If a warrior level 1 fights an enemy level 1, they will receive 10 experience points.","time":{"start":1732764218782,"stop":1732764218782,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"If a warrior level 1 fights an enemy level 3, they will receive 80 experience points.","time":{"start":1732764218782,"stop":1732764218782,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_BattleTestCase::0","time":{"start":1732764218785,"stop":1732764218785,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"RULES"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"OOP"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"epic","value":"4 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_battle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"afca78445b5fa23f","status":"passed","time":{"start":1732428194132,"stop":1732428194132,"duration":0}},{"uid":"552b72a0721ea486","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}},{"uid":"921715088233c4e7","status":"passed","time":{"start":1724733472515,"stop":1724733472515,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"ac136a3215f7ad6c","status":"passed","time":{"start":1732428194132,"stop":1732428194132,"duration":0}},{"uid":"d558fd9b3bcee4ae","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}},{"uid":"6ce4bba2ff4664c2","status":"passed","time":{"start":1724735127407,"stop":1724735127407,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES","ALGORITHMS","RULES"]},"source":"c00621abb22a9be3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/38b436d46d6537ee.json b/allure-report/data/test-cases/c03eb686eb3e5a89.json similarity index 61% rename from allure-report/data/test-cases/38b436d46d6537ee.json rename to allure-report/data/test-cases/c03eb686eb3e5a89.json index 060d186231f..debc7011b52 100644 --- a/allure-report/data/test-cases/38b436d46d6537ee.json +++ b/allure-report/data/test-cases/c03eb686eb3e5a89.json @@ -1 +1 @@ -{"uid":"38b436d46d6537ee","name":"Testing period_is_late function (negative)","fullName":"kyu_8.is_your_period_late.test_is_your_period_late.PeriodIsLateTestCase#test_period_is_late_negative","historyId":"3ade0b8dc3a70452a99ea470cea361ac","time":{"start":1724733474772,"stop":1724733474772,"duration":0},"description":"\n Negative tests\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: remove\n :return:\n ","descriptionHtml":"Testing remove method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732764219358,"stop":1732764219358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Remove items from the list","time":{"start":1732764219358,"stop":1732764219358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219358,"stop":1732764219358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219358,"stop":1732764219358,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732764219359,"stop":1732764219359,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"story","value":"DefaultList"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a6a59cc8a0131a02","status":"passed","time":{"start":1732428194678,"stop":1732428194679,"duration":1}},{"uid":"ae08758c48a63481","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}},{"uid":"7de68906bfa0f18","status":"passed","time":{"start":1724733473171,"stop":1724733473186,"duration":15}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"239a317b6e090fd8","status":"passed","time":{"start":1732428194678,"stop":1732428194679,"duration":1}},{"uid":"51a9aec46de8d878","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}},{"uid":"43c0068fe0a1265e","status":"passed","time":{"start":1724735128063,"stop":1724735128078,"duration":15}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"c0a4502fedd41667.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c0b1085f1fbfd7ed.json b/allure-report/data/test-cases/c0b1085f1fbfd7ed.json new file mode 100644 index 00000000000..8c960de9074 --- /dev/null +++ b/allure-report/data/test-cases/c0b1085f1fbfd7ed.json @@ -0,0 +1 @@ +{"uid":"c0b1085f1fbfd7ed","name":"Testing permute_a_palindrome (positive)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_positive","historyId":"faf1054cf60e3f1fbb45c8dc0ece579f","time":{"start":1732764220254,"stop":1732764220254,"duration":0},"description":"\n Testing permute_a_palindrome function\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"4f617786d1167bf5","name":"stdout","source":"4f617786d1167bf5.txt","type":"text/plain","size":2146}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"7d905be84b5c0b77.json","parameterValues":[]} \ No newline at end of file +{"uid":"c0b9bbb0a9f351b0","name":"Testing to_table function","fullName":"kyu_6.array_to_html_table.test_list_to_html_table.ArrayToTableTestCase#test_array_to_table_function","historyId":"d7b951f3d87d7ec30599f08ae5567eb7","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2e0ebd0ab799745b","name":"stdout","source":"2e0ebd0ab799745b.txt","type":"text/plain","size":2146}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"feature","value":"Lists"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"c0b9bbb0a9f351b0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c0d55ad9fdfb0f8a.json b/allure-report/data/test-cases/c10fb0178a326f0a.json similarity index 68% rename from allure-report/data/test-cases/c0d55ad9fdfb0f8a.json rename to allure-report/data/test-cases/c10fb0178a326f0a.json index 2080224bb0e..7fac6e1a55e 100644 --- a/allure-report/data/test-cases/c0d55ad9fdfb0f8a.json +++ b/allure-report/data/test-cases/c10fb0178a326f0a.json @@ -1 +1 @@ -{"uid":"c0d55ad9fdfb0f8a","name":"Testing toJadenCase function (negative)","fullName":"kyu_7.jaden_casing_strings.test_jaden_casing_strings.JadenCasingStringsTestCase#test_to_jaden_case_negative","historyId":"3a2cad5dab684132d1f8974f9a6b5c75","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"description":"\n Simple negative test\n :return:\n ","descriptionHtml":"The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732764219337,"stop":1732764219338,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Extend the list list","time":{"start":1732764219338,"stop":1732764219338,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219338,"stop":1732764219338,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219338,"stop":1732764219338,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219338,"stop":1732764219339,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732764219359,"stop":1732764219359,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"story","value":"DefaultList"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d4941a73e9c93a57","status":"passed","time":{"start":1732428194661,"stop":1732428194663,"duration":2}},{"uid":"256439519ef758bc","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"9d50fe36fd5059ab","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"5fabad9204d0747c","status":"passed","time":{"start":1732428194661,"stop":1732428194663,"duration":2}},{"uid":"826a0963540c6e75","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"4359475f5ec554bd","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"c244be500ebdf146.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c25f8210fdb51a41.json b/allure-report/data/test-cases/c25f8210fdb51a41.json new file mode 100644 index 00000000000..eeb33f3b5b6 --- /dev/null +++ b/allure-report/data/test-cases/c25f8210fdb51a41.json @@ -0,0 +1 @@ +{"uid":"c25f8210fdb51a41","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1732764218647,"stop":1732764218647,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"PERMUTATIONS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"story","value":"Permutations"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"682ca0c47ecc45d4","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428193998,"stop":1732428193998,"duration":0}},{"uid":"740e72b931a3ed2d","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"ef2ebe964f1d2f5f","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472390,"stop":1724733472390,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":4,"passed":0,"unknown":0,"total":4},"items":[{"uid":"4942ac4be65ef1b0","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1732428193998,"stop":1732428193998,"duration":0}},{"uid":"1319e1ae94efdc02","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"6fbcaa806475fb37","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c25f8210fdb51a41.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/a8b77a6618ff7e4c.json b/allure-report/data/test-cases/c264906d7bf954d5.json
similarity index 94%
rename from allure-report/data/test-cases/a8b77a6618ff7e4c.json
rename to allure-report/data/test-cases/c264906d7bf954d5.json
index a895f3dad63..daa4e8232f3 100644
--- a/allure-report/data/test-cases/a8b77a6618ff7e4c.json
+++ b/allure-report/data/test-cases/c264906d7bf954d5.json
@@ -1 +1 @@
-{"uid":"a8b77a6618ff7e4c","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Josephus Survivor"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a8b77a6618ff7e4c.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"c264906d7bf954d5","name":"test_josephus_survivor","fullName":"kyu_5.josephus_survivor.test_josephus_survivor.JosephusSurvivorTestCase#test_josephus_survivor","historyId":"334b612b45e8a87e83a3482704f4ba8a","time":{"start":1724733472921,"stop":1724733472921,"duration":0},"description":"\n In this kata you have to correctly return who\n is the \"survivor\", ie: the last element of a\n Josephus permutation.\n :return:\n ","descriptionHtml":" In this kata you have to correctly return who\n is the "survivor", ie: the last element of a\n Josephus permutation.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\josephus_survivor\\\\test_josephus_survivor.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Josephus Survivor"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.josephus_survivor.test_josephus_survivor"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/555624b601231dc7a400017a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","LISTS","NUMBERS","ALGORITHMS","DATA STRUCTURES","ARRAYS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"c264906d7bf954d5.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/c2a15dd126224894.json b/allure-report/data/test-cases/c2a15dd126224894.json
new file mode 100644
index 00000000000..bf600579a66
--- /dev/null
+++ b/allure-report/data/test-cases/c2a15dd126224894.json
@@ -0,0 +1 @@
+{"uid":"c2a15dd126224894","name":"Testing remove_char function","fullName":"kyu_8.remove_first_and_last_character.test_remove_char.RemoveCharTestCase#test_remove_char","historyId":"094915dd36d829c22ed2375a32962ac5","time":{"start":1732764221181,"stop":1732764221181,"duration":0},"description":"\n Test that 'remove_char' function\n removes the first and\n last characters of a string.\n :return:\n ","descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"You will be given an array representing the number of chips of each color and your task is to return the maximum number of days you can pick the chips. Each day you need to take exactly two chips.
","status":"passed","steps":[{"name":"Enter an array ([8, 8, 8]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 1, 1]) and verify the expected output (1) vs actual result (1)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 1, 4]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([7, 4, 10]) and verify the expected output (10) vs actual result (10)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([12, 12, 12]) and verify the expected output (18) vs actual result (18)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([6, 6, 6]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 23, 2]) and verify the expected output (3) vs actual result (3)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([9, 8, 6]) and verify the expected output (11) vs actual result (11)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([10, 9, 6]) and verify the expected output (12) vs actual result (12)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 4, 3]) and verify the expected output (5) vs actual result (5)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([1, 2, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([4, 1, 1]) and verify the expected output (2) vs actual result (2)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an array ([8, 2, 8]) and verify the expected output (9) vs actual result (9)","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"d2685b3f41e9f61c","name":"stdout","source":"d2685b3f41e9f61c.txt","type":"text/plain","size":640}],"parameters":[],"stepsCount":13,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolveTestCase::0","time":{"start":1724735127984,"stop":1724735127984,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Casino chips"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.casino_chips.test_solve"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e0b72d2d772160011133654/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"c61d34eb10bf204.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c6923016c0d7805e.json b/allure-report/data/test-cases/c6923016c0d7805e.json deleted file mode 100644 index e3eb1c4a2a6..00000000000 --- a/allure-report/data/test-cases/c6923016c0d7805e.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"c6923016c0d7805e","name":"Testing make_class function","fullName":"kyu_7.make_class.test_make_class.MakeClassTestCase#test_make_class","historyId":"2fc0cf409058113d339743775fa3158e","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing make_class function\n :return:\n ","descriptionHtml":"Give me the power to create a similar class like this:
Animal = make_class(\"name\", \"species\", \"age\", \"health\", \"weight\", \"color\")
","status":"passed","steps":[{"name":"Test class creation by using a function","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[{"name":"Assert that classes have Bob arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have Dog arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 5 arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have good arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have 50lb arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert that classes have brown arg","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"50b324c74021da7c","name":"stdout","source":"50b324c74021da7c.txt","type":"text/plain","size":148}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_MakeClassTestCase::0","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Make Class"},{"name":"parentSuite","value":"Beginner"},{"name":"feature","value":"Classes"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"OOP"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.make_class.test_make_class"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":[]},"source":"c6923016c0d7805e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c700736d12b44c86.json b/allure-report/data/test-cases/c700736d12b44c86.json new file mode 100644 index 00000000000..c2aa57e412f --- /dev/null +++ b/allure-report/data/test-cases/c700736d12b44c86.json @@ -0,0 +1 @@ +{"uid":"c700736d12b44c86","name":"'multiply' function verification: lists with multiple digits","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest","historyId":"6105a97f729c5e36b325cf44492db688","time":{"start":1732764220619,"stop":1732764220619,"duration":0},"description":"\n Test lists with multiple digits\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing epidemic function\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1732428194689,"stop":1732428194689,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1732428194691,"stop":1732428194691,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Disease Spread"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b890a6fea083097f","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}},{"uid":"6207ccc30173aa77","status":"passed","time":{"start":1724733473186,"stop":1724733473186,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"c1e0648976f6a694","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}},{"uid":"b3f7088fed8dedd7","status":"passed","time":{"start":1724735128078,"stop":1724735128078,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"5f6f3bc16b3488d6.json","parameterValues":[]} \ No newline at end of file +{"uid":"c7c4d343c90ce082","name":"Testing epidemic function","fullName":"kyu_6.disease_spread.test_epidemic.EpidemicTestCase#test_epidemic","historyId":"e2edeca1f212268fe8082320adfcc98c","time":{"start":1732428194686,"stop":1732428194689,"duration":3},"description":"\n Testing epidemic function\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing epidemic function\n :return:\n ","descriptionHtml":"The function epidemic should return the maximum number of infected as an integer (truncate to integer the result of max(I)).
","status":"passed","steps":[{"name":"Enter test data (tm: 18, n: 432, s0: 1004, i0: 1, b: 0.00209, a: 0.51, expected: 420) and verify the expected output (420) vs actual result (420)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 12, n: 288, s0: 1007, i0: 2, b: 0.00206, a: 0.45, expected: 461) and verify the expected output (461) vs actual result (461)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 999, i0: 1, b: 0.00221, a: 0.55, expected: 409) and verify the expected output (409) vs actual result (409)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 1005, i0: 1, b: 0.00216, a: 0.45, expected: 474) and verify the expected output (474) vs actual result (474)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 24, n: 576, s0: 982, i0: 1, b: 0.00214, a: 0.44, expected: 460) and verify the expected output (460) vs actual result (460)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 20, n: 480, s0: 1000, i0: 1, b: 0.00199, a: 0.53, expected: 386) and verify the expected output (386) vs actual result (386)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 980, i0: 1, b: 0.00198, a: 0.44, expected: 433) and verify the expected output (433) vs actual result (433)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 14, n: 336, s0: 996, i0: 2, b: 0.00206, a: 0.41, expected: 483) and verify the expected output (483) vs actual result (483)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 13, n: 312, s0: 993, i0: 2, b: 0.0021, a: 0.51, expected: 414) and verify the expected output (414) vs actual result (414)","time":{"start":1732428194686,"stop":1732428194686,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (tm: 28, n: 672, s0: 999, i0: 1, b: 0.00197, a: 0.55, expected: 368) and verify the expected output (368) vs actual result (368)","time":{"start":1732428194689,"stop":1732428194689,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EpidemicTestCase::0","time":{"start":1732428194691,"stop":1732428194691,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Disease Spread"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.disease_spread.test_epidemic"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/566543703c72200f0b0000c9","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"c7c4d343c90ce082.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c87eac92a1b3b456.json b/allure-report/data/test-cases/c87eac92a1b3b456.json new file mode 100644 index 00000000000..24661fef116 --- /dev/null +++ b/allure-report/data/test-cases/c87eac92a1b3b456.json @@ -0,0 +1 @@ +{"uid":"c87eac92a1b3b456","name":"Testing length function","fullName":"kyu_7.fun_with_lists_length.test_length.LengthTestCase#test_length","historyId":"b71e871d53b429aef63593ea1f41c8bc","time":{"start":1732764220523,"stop":1732764220523,"duration":0},"description":"\n Testing length function\n\n The method length, which accepts a linked list\n (head), and returns the length of the list.\n :return:\n ","descriptionHtml":"Testing position property based on positive grids.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase","time":{"start":1732428193927,"stop":1732428193927,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":"Testing position property based on positive grids.
","status":"passed","steps":[{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test grid and compare the output/position vs expected result X","time":{"start":1732428193934,"stop":1732428193934,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WalkerClassTestCase::0","time":{"start":1732428193935,"stop":1732428193935,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"c8da32e94b736fef.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f449c3e5994db83f.json b/allure-report/data/test-cases/c8de14a6ed49ac6d.json similarity index 72% rename from allure-report/data/test-cases/f449c3e5994db83f.json rename to allure-report/data/test-cases/c8de14a6ed49ac6d.json index ea1faa9c0ca..e7d6ab19a00 100644 --- a/allure-report/data/test-cases/f449c3e5994db83f.json +++ b/allure-report/data/test-cases/c8de14a6ed49ac6d.json @@ -1 +1 @@ -{"uid":"f449c3e5994db83f","name":"Testing is_palindrome function","fullName":"kyu_8.is_it_a_palindrome.test_is_palindrome.IsPalindromeTestCase#test_is_palindrome","historyId":"4967a6ca0665c8eeeec85898f8bda8f5","time":{"start":1724735129539,"stop":1724735129539,"duration":0},"description":"\n Testing is_palindrome function\n with various test inputs\n\n The function should check if a\n given string (case insensitive)\n is a palindrome.\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"857a5351e31f1baf","name":"stdout","source":"857a5351e31f1baf.txt","type":"text/plain","size":878}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"97ad1cd914697b30.json","parameterValues":[]} \ No newline at end of file +{"uid":"c91f2e2d1c4e5a72","name":"Testing Encoding functionality","fullName":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding.EncodingTestCase#test_encoding","historyId":"195b2d3cd638502ec301b9e9eaa3f969","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Encoding functionality\n ","descriptionHtml":"Verify cipher function. This \"encode\" is used to encode a string by placing each character successively in a diagonal along a set of \"rails\".
","status":"passed","steps":[{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and compare the output vs expected result","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1dfb198a7253b941","name":"stdout","source":"1dfb198a7253b941.txt","type":"text/plain","size":878}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EncodingTestCase::0","time":{"start":1724735127203,"stop":1724735127203,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"CIPHERS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"story","value":"Rail Fence Cipher: Encoding and Decoding"},{"name":"tag","value":"SECURITY"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"CRYPTOGRAPHY"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.rail_fence_cipher_encoding_and_decoding.test_encoding"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/58c5577d61aefcf3ff000081/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CIPHERS","SECURITY","ALGORITHMS","CRYPTOGRAPHY"]},"source":"c91f2e2d1c4e5a72.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7087926d4a83e9d4.json b/allure-report/data/test-cases/c948f5411c74f4a1.json similarity index 63% rename from allure-report/data/test-cases/7087926d4a83e9d4.json rename to allure-report/data/test-cases/c948f5411c74f4a1.json index 792f7014551..44723c5b7b9 100644 --- a/allure-report/data/test-cases/7087926d4a83e9d4.json +++ b/allure-report/data/test-cases/c948f5411c74f4a1.json @@ -1 +1 @@ -{"uid":"7087926d4a83e9d4","name":"Testing all_fibonacci_numbers function","fullName":"kyu_5.fibonacci_streaming.test_all_fibonacci_numbers.AllFibonacciNumbersTestCase#test_all_fibonacci_numbers","historyId":"a7b5f0a3a7cd2fe8faed75e5c4a52138","time":{"start":1732428194224,"stop":1732428194224,"duration":0},"description":"\n Testing all_fibonacci_numbers function\n\n You're going to provide a needy programmer a\n utility method that generates an infinite sized,\n sequential IntStream (in Python generator)\n which contains all the numbers in a fibonacci\n sequence.\n\n A fibonacci sequence starts with two 1s.\n Every element afterwards is the sum of\n the two previous elements.\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calc_combinations_per_row function\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c94aec0d920b7f7d","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}},{"uid":"32b8a7a180fb722f","status":"passed","time":{"start":1724733474210,"stop":1724733474210,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"5a941d3b90762a67","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}},{"uid":"5ef0ca25b0e8e9c5","status":"passed","time":{"start":1724735129055,"stop":1724735129055,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"de0aa71757f8badf.json","parameterValues":[]} \ No newline at end of file +{"uid":"cad7274be200bf39","name":"Testing calc_combinations_per_row function","fullName":"kyu_7.easy_line.test_easyline.EasyLineTestCase#test_calc_combinations_per_row","historyId":"7fcdfe6224a9c1bf62e1c03968cb029e","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"description":"\n Testing calc_combinations_per_row function\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1732428195775,"stop":1732428195775,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calc_combinations_per_row function\n :return:\n ","descriptionHtml":"The function should take row number and return Pascal's Triangle combination per that row coefficients on line n.
","status":"passed","steps":[{"name":"Enter row number (0) and assert expected (1) vs actual (1).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (1) and assert expected (1) vs actual (1).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (2) and assert expected (2) vs actual (2).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (3) and assert expected (3) vs actual (3).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (4) and assert expected (4) vs actual (4).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (5) and assert expected (5) vs actual (5).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (6) and assert expected (6) vs actual (6).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter row number (7) and assert expected (7) vs actual (7).","time":{"start":1732428195776,"stop":1732428195776,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1732428195789,"stop":1732428195789,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Easy Line"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"cad7274be200bf39.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/20ae87fc51fb9338.json b/allure-report/data/test-cases/caf985b2a75ee6b7.json similarity index 74% rename from allure-report/data/test-cases/20ae87fc51fb9338.json rename to allure-report/data/test-cases/caf985b2a75ee6b7.json index 1ffd86d1543..019efc8ca6b 100644 --- a/allure-report/data/test-cases/20ae87fc51fb9338.json +++ b/allure-report/data/test-cases/caf985b2a75ee6b7.json @@ -1 +1 @@ -{"uid":"20ae87fc51fb9338","name":"Testing pig_it function","fullName":"kyu_5.simple_pig_latin.test_pig_it.PigItTestCase#test_pig_it","historyId":"c5f1cfe64ff8d3a4f16a4166c571797e","time":{"start":1724735127875,"stop":1724735127875,"duration":0},"description":"\n Testing pig_it function\n\n The function should mpve the first letter of each\n word to the end of it, then add \"ay\" to the end\n of the word. Leave punctuation marks untouched.\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cca44b266aa98436","name":"stdout","source":"cca44b266aa98436.txt","type":"text/plain","size":213}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"story","value":"Sum of odd numbers"},{"name":"feature","value":"Math"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"8c72192846448826.json","parameterValues":[]} \ No newline at end of file +{"uid":"cb7d8edff0d47cc5","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9ca1d978c6df1121","name":"stdout","source":"9ca1d978c6df1121.txt","type":"text/plain","size":213}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1724733474460,"stop":1724733474460,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"story","value":"Sum of odd numbers"},{"name":"feature","value":"Math"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"cb7d8edff0d47cc5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cb9f6d4c2aaf90e3.json b/allure-report/data/test-cases/cb9f6d4c2aaf90e3.json new file mode 100644 index 00000000000..fd5d2c49123 --- /dev/null +++ b/allure-report/data/test-cases/cb9f6d4c2aaf90e3.json @@ -0,0 +1 @@ +{"uid":"cb9f6d4c2aaf90e3","name":"Testing gap function","fullName":"kyu_7.find_the_longest_gap.test_gap.GapTestCase#test_gap","historyId":"629f8f3c77ceed21b9aefeb6ebebc433","time":{"start":1732764220509,"stop":1732764220509,"duration":0},"description":"\n Testing gap function with various test inputs\n\n A binary gap within a positive number num is\n any sequence of consecutive zeros that is\n surrounded by ones at both ends in the binary\n representation of num.\n\n The gap function should return the length of\n its longest binary gap.\n\n The function should return 0 if num doesn't\n contain a binary gap.\n :return:\n ","descriptionHtml":"Test a function that processes sequence of jobs and returns a positive integer representing the cc ittakes to complete the job at index.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SJFTestCase","time":{"start":1732428195625,"stop":1732428195625,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'shortest_job_first' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of jobs and returns a positive integer representing the cc ittakes to complete the job at index.
","status":"passed","steps":[{"name":"Enter a n (([0], 0)) and verify the expected output (100) vs actual result (100)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 10, 20, 0, 0], 0)) and verify the expected output (6) vs actual result (6)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 0, 20, 0, 0], 1)) and verify the expected output (16) vs actual result (16)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 0, 10, 20, 0, 0], 1)) and verify the expected output (16) vs actual result (16)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 0, 0, 20, 0, 0], 2)) and verify the expected output (26) vs actual result (26)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([20, 20, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 19, 0, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 20, 0, 19, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 18, 0, 0], 75)) and verify the expected output (1008) vs actual result (1008)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a n (([0, 13, 13, 12, 17, 0, 15, 0, 12, 0, 15, 0, 0, 12, 19, 11, 10, 0, 11, 18, 0, 0, 15, 20, 0, 16, 12, 17, 0, 0, 10, 19, 0, 9, 0, 16, 19, 16, 15, 0, 17, 0, 13, 11, 19, 18, 13, 10, 0, 20, 0, 10, 9, 18, 14, 18, 0, 15, 17, 10, 17, 0, 0, 0, 18, 0, 0, 19, 14, 0, 0, 19, 19, 0, 0, 0, 0, 0, 9, 18, 0, 0, 11, 16, 0, 0, 0, 0, 10, 0, 17, 0, 16, 0, 0, 0, 16, 0, 13, 20, 0, 20, 20, 0, 0, 20, 14, 0, 11, 0, 9, 0, 0, 20, 11, 17, 0, 12, 13, 16, 13, 19, 0, 18, 20, 0, 19, 10, 19, 12, 0, 18, 0, 14, 9, 0, 0, 0, 13, 14, 9, 18, 9, 11, 19, 10, 20, 17, 13, 0, 13, 0, 12, 0, 19, 0, 14, 0, 20, 0, 14, 12, 11, 18, 0, 0, 9, 0, 19], 24)) and verify the expected output (275) vs actual result (275)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SJFTestCase::0","time":{"start":1732428195628,"stop":1732428195628,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"QUEUES"},{"name":"story","value":"Scheduling (Shortest Job First or SJF)"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"SCHEDULING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.scheduling.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550cc572b9e7b563be00054f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"tags":["SCHEDULING","QUEUES","ALGORITHMS"]},"source":"a224a931a5567f85.json","parameterValues":[]} \ No newline at end of file +{"uid":"cbe27b4f7111917c","name":"Testing 'shortest_job_first(' function","fullName":"kyu_6.scheduling.test_solution.SJFTestCase#test_sjf","historyId":"da4a41f0bf9943ee34282e89227dd9a2","time":{"start":1732428195625,"stop":1732428195626,"duration":1},"description":"\n Testing 'shortest_job_first' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of jobs and returns a positive integer representing the cc ittakes to complete the job at index.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SJFTestCase","time":{"start":1732428195625,"stop":1732428195625,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'shortest_job_first' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of jobs and returns a positive integer representing the cc ittakes to complete the job at index.
","status":"passed","steps":[{"name":"Enter a n (([0], 0)) and verify the expected output (100) vs actual result (100)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 10, 20, 0, 0], 0)) and verify the expected output (6) vs actual result (6)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 0, 20, 0, 0], 1)) and verify the expected output (16) vs actual result (16)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 0, 10, 20, 0, 0], 1)) and verify the expected output (16) vs actual result (16)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 0, 0, 20, 0, 0], 2)) and verify the expected output (26) vs actual result (26)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([20, 20, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 19, 0, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 20, 0, 19, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 18, 0, 0], 75)) and verify the expected output (1008) vs actual result (1008)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 13, 13, 12, 17, 0, 15, 0, 12, 0, 15, 0, 0, 12, 19, 11, 10, 0, 11, 18, 0, 0, 15, 20, 0, 16, 12, 17, 0, 0, 10, 19, 0, 9, 0, 16, 19, 16, 15, 0, 17, 0, 13, 11, 19, 18, 13, 10, 0, 20, 0, 10, 9, 18, 14, 18, 0, 15, 17, 10, 17, 0, 0, 0, 18, 0, 0, 19, 14, 0, 0, 19, 19, 0, 0, 0, 0, 0, 9, 18, 0, 0, 11, 16, 0, 0, 0, 0, 10, 0, 17, 0, 16, 0, 0, 0, 16, 0, 13, 20, 0, 20, 20, 0, 0, 20, 14, 0, 11, 0, 9, 0, 0, 20, 11, 17, 0, 12, 13, 16, 13, 19, 0, 18, 20, 0, 19, 10, 19, 12, 0, 18, 0, 14, 9, 0, 0, 0, 13, 14, 9, 18, 9, 11, 19, 10, 20, 17, 13, 0, 13, 0, 12, 0, 19, 0, 14, 0, 20, 0, 14, 12, 11, 18, 0, 0, 9, 0, 19], 24)) and verify the expected output (275) vs actual result (275)","time":{"start":1732428195626,"stop":1732428195626,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SJFTestCase::0","time":{"start":1732428195628,"stop":1732428195628,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"QUEUES"},{"name":"story","value":"Scheduling (Shortest Job First or SJF)"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"feature","value":"Algorithms"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"SCHEDULING"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.scheduling.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550cc572b9e7b563be00054f","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["SCHEDULING","QUEUES","ALGORITHMS"]},"source":"cbe27b4f7111917c.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/cc4dd11ea285cd92.json b/allure-report/data/test-cases/cc4dd11ea285cd92.json new file mode 100644 index 00000000000..699544b8dba --- /dev/null +++ b/allure-report/data/test-cases/cc4dd11ea285cd92.json @@ -0,0 +1 @@ +{"uid":"cc4dd11ea285cd92","name":"Testing 'count_sheeps' function: mixed list","fullName":"kyu_8.counting_sheep.test_counting_sheep.CountingSheepTestCase#test_counting_sheep_mixed_list","historyId":"1b4dd61e36f8ec4ee2f83635d4e16e21","time":{"start":1732764220907,"stop":1732764220907,"duration":0},"description":"\n Testing 'count_sheeps' function\n Hint: Don't forget to check for\n bad values like mixed list\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase","time":{"start":1724735128836,"stop":1724735128836,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function that should take a shuffled list of unique numbers\n from 1 to n with one element missing (which can be any\n number including n). Should return this missing number.\n\n :return:\n ","descriptionHtml":"Test a function that should take a shuffled list of unique numbers from 1 to n with one element missing (which can be any number including n). The function should return the missing number.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output: 1 vs actual result: 1","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 2 vs actual result: 2","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 3 vs actual result: 3","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 4 vs actual result: 4","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output: 36 vs actual result: 36","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b3fc324c4038294","name":"stdout","source":"b3fc324c4038294.txt","type":"text/plain","size":2621}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FindMissingNumberTestCase::0","time":{"start":1724735128852,"stop":1724735128852,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PERFORMANCE"},{"name":"story","value":"Number Zoo Patrol"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"MATHEMATICS"},{"name":"feature","value":"Math"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.number_zoo_patrol.test_find_missing_number"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5276c18121e20900c0000235/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","NUMBERS","PERFORMANCE","ALGORITHMS"]},"source":"ccb7c5007831ab45.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9521eb418a2faa99.json b/allure-report/data/test-cases/cce644bc4fb0b16f.json similarity index 65% rename from allure-report/data/test-cases/9521eb418a2faa99.json rename to allure-report/data/test-cases/cce644bc4fb0b16f.json index 64b7ce1e6d4..f8714618b79 100644 --- a/allure-report/data/test-cases/9521eb418a2faa99.json +++ b/allure-report/data/test-cases/cce644bc4fb0b16f.json @@ -1 +1 @@ -{"uid":"9521eb418a2faa99","name":"Testing 'solution' function","fullName":"kyu_7.pull_your_words_together_man.test_sentencify.SentencifyTestCase#test_sentencify","historyId":"5821e6355bce2a3bf46d4ce3e55de034","time":{"start":1732428195914,"stop":1732428195914,"duration":0},"description":"\n Testing 'sentencify' function.\n The function should:\n 1. Capitalise the first letter of the first word.\n 2. Add a period (.) to the end of the sentence.\n 3. Join the words into a complete string, with spaces.\n 4. Do no other manipulation on the words.\n\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a7f10bb4c8e33c64","name":"stdout","source":"a7f10bb4c8e33c64.txt","type":"text/plain","size":1579}],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"7e5150fbd4a33237.json","parameterValues":[]} \ No newline at end of file +{"uid":"ce75fbdf4ccd46b8","name":"Testing sum_for_list function","fullName":"kyu_4.sum_by_factors.test_sum_for_list.SumForListTestCase#test_sum_for_list","historyId":"d8ed55046475c7e2ae8edf6bff7b1316","time":{"start":1724735127313,"stop":1724735127391,"duration":78},"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing sum_for_list function\n :return:\n ","descriptionHtml":"Verify that one given an array of positive or negative integers I= [i1,..,in] the function produces a sorted array P of the form [[p, sum of all ij of I for which p is a prime factor (p positive) of ij]...]
","status":"passed","steps":[{"name":"Enter test list ([12, 15]) and verify the output ([[2, 12], [3, 27], [5, 15]]) vs expected ([[2, 12], [3, 27], [5, 15]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, 21, 24, 30, 45]) and verify the output ([[2, 54], [3, 135], [5, 90], [7, 21]]) vs expected ([[2, 54], [3, 135], [5, 90], [7, 21]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([107, 158, 204, 100, 118, 123, 126, 110, 116, 100]) and verify the output ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]]) vs expected ([[2, 1032], [3, 453], [5, 310], [7, 126], [11, 110], [17, 204], [29, 116], [41, 123], [59, 118], [79, 158], [107, 107]])","time":{"start":1724735127313,"stop":1724735127313,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([-29804, -4209, -28265, -72769, -31744]) and verify the output ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]]) vs expected ([[2, -61548], [3, -4209], [5, -28265], [23, -4209], [31, -31744], [53, -72769], [61, -4209], [1373, -72769], [5653, -28265], [7451, -29804]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([15, -36, -133, -61, -54, 78, -126, -113, -106, -158]) and verify the output ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]]) vs expected ([[2, -402], [3, -123], [5, 15], [7, -259], [13, 78], [19, -133], [53, -106], [61, -61], [79, -158], [113, -113]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([154, -150, -196, -164, -57, 133, -110, -126, -191, -171, 131, -55, -85, -37, -113]) and verify the output ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]]) vs expected ([[2, -592], [3, -504], [5, -400], [7, -35], [11, -11], [17, -85], [19, -95], [37, -37], [41, -164], [113, -113], [131, 131], [191, -191]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test list ([12, -138, -175, -64, -153, 11, -11, -126, -67, -30, 153, -72, -102]) and verify the output ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]]) vs expected ([[2, -520], [3, -456], [5, -205], [7, -301], [11, 0], [17, -102], [23, -138], [67, -67]])","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"45607bc70f60caca","name":"stdout","source":"45607bc70f60caca.txt","type":"text/plain","size":1579}],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumForListTestCase::0","time":{"start":1724735127391,"stop":1724735127391,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"NUMBERS"},{"name":"story","value":"Sum by Factors"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.sum_by_factors.test_sum_for_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d496788776e49e6b00052f/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["NUMBERS","ALGORITHMS","ARRAYS"]},"source":"ce75fbdf4ccd46b8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/71e40623077306da.json b/allure-report/data/test-cases/ceb0c3e5ec48d975.json similarity index 57% rename from allure-report/data/test-cases/71e40623077306da.json rename to allure-report/data/test-cases/ceb0c3e5ec48d975.json index 95b67bf7b34..29c1a341b4e 100644 --- a/allure-report/data/test-cases/71e40623077306da.json +++ b/allure-report/data/test-cases/ceb0c3e5ec48d975.json @@ -1 +1 @@ -{"uid":"71e40623077306da","name":"Non is expected","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_none","historyId":"262134764fa6664c0e3055da165452d3","time":{"start":1732428196174,"stop":1732428196175,"duration":1},"description":"\n If the whole array is consecutive then return\n null or Nothing or None.\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"bfa0e041a65d579a","name":"stdout","source":"bfa0e041a65d579a.txt","type":"text/plain","size":1380}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ASCII"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Character Encodings"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BINARY"},{"name":"tag","value":"FORMATS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["CHARACTER ENCODINGS","STRINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"8949506fce676285.json","parameterValues":[]} \ No newline at end of file +{"uid":"cedf72c8fbbfdfc5","name":"Testing binary_to_string function","fullName":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string.SequenceTestCase#test_binary_to_string","historyId":"5e3d4a7b89a7ecee6b57c2383b63527b","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"f4b8bcccd8e3d9a5","name":"stdout","source":"f4b8bcccd8e3d9a5.txt","type":"text/plain","size":1380}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1724735127969,"stop":1724735127969,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ASCII"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Character Encodings"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"epic","value":"6 kyu"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"BINARY"},{"name":"tag","value":"FORMATS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["CHARACTER ENCODINGS","STRINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"cedf72c8fbbfdfc5.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/937c9b1e748aadb0.json b/allure-report/data/test-cases/cefd3a9afeec351e.json similarity index 68% rename from allure-report/data/test-cases/937c9b1e748aadb0.json rename to allure-report/data/test-cases/cefd3a9afeec351e.json index 84ad7af05b2..fa11270813d 100644 --- a/allure-report/data/test-cases/937c9b1e748aadb0.json +++ b/allure-report/data/test-cases/cefd3a9afeec351e.json @@ -1 +1 @@ -{"uid":"937c9b1e748aadb0","name":"Test with empty string","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_empty","historyId":"2af6aa545c98eb65f8404392b6468813","time":{"start":1724735129649,"stop":1724735129649,"duration":0},"description":"\n Test with empty string\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase","time":{"start":1732764221017,"stop":1732764221017,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing greek_comparator function\n with various test inputs\n :return:\n ","descriptionHtml":"A custom comparison function of two arguments (iterable elements) which should return a negative, zero or positive number depending on whether the first argument is considered smaller than, equal to, or larger than the second argument
","status":"passed","steps":[{"name":"Enter test inputs(alpha, beta) and assert expected (< 0) vs actual result (-1)","time":{"start":1732764221018,"stop":1732764221018,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(psi, psi) and assert expected (== 0) vs actual result (0)","time":{"start":1732764221018,"stop":1732764221018,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test inputs(upsilon, rho) and assert expected (> 0) vs actual result (3)","time":{"start":1732764221018,"stop":1732764221018,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GreekComparatorTestCase::0","time":{"start":1732764221020,"stop":1732764221020,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Greek Sort"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Tuple"},{"name":"epic","value":"8 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.greek_sort.test_greek_comparator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56bc1acf66a2abc891000561","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"7e0fbf3b4505484b","status":"passed","time":{"start":1732428196230,"stop":1732428196230,"duration":0}},{"uid":"3e88e2d0381e105a","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"a12dc2585f9de41f","status":"passed","time":{"start":1724733474725,"stop":1724733474725,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"a4849e99633e4676","status":"passed","time":{"start":1732428196230,"stop":1732428196230,"duration":0}},{"uid":"327fbdea3443aca5","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"c301f45b01d7d10f","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["FUNDAMENTALS"]},"source":"d0246537274067fb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d0931e78c129f8d8.json b/allure-report/data/test-cases/d0931e78c129f8d8.json new file mode 100644 index 00000000000..5aa1f91397a --- /dev/null +++ b/allure-report/data/test-cases/d0931e78c129f8d8.json @@ -0,0 +1 @@ +{"uid":"d0931e78c129f8d8","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1732764220261,"stop":1732764220261,"duration":0},"description":"\n Testing calculate_damage with various test data\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1732764220260,"stop":1732764220260,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calculate_damage with various test data\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1732764220261,"stop":1732764220261,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1732764220261,"stop":1732764220261,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1732764220261,"stop":1732764220261,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1732764220261,"stop":1732764220261,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1732764220261,"stop":1732764220261,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1732764220261,"stop":1732764220261,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1732764220261,"stop":1732764220261,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1732764220262,"stop":1732764220262,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"FUNCTIONS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Games"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e55f716219844475","status":"passed","time":{"start":1732428195580,"stop":1732428195580,"duration":0}},{"uid":"962ca80dcc908350","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"98366b42396826ce","status":"passed","time":{"start":1724733474023,"stop":1724733474023,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"f91e38b8c375d31c","status":"passed","time":{"start":1732428195580,"stop":1732428195580,"duration":0}},{"uid":"90a24ba96aea3cfc","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"396df158495e2556","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","NUMBERS","GAMES","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"d0931e78c129f8d8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3f94de18ab2e95fb.json b/allure-report/data/test-cases/d0ce09c4ba5ff697.json similarity index 68% rename from allure-report/data/test-cases/3f94de18ab2e95fb.json rename to allure-report/data/test-cases/d0ce09c4ba5ff697.json index dd1df8686b6..e2942641a39 100644 --- a/allure-report/data/test-cases/3f94de18ab2e95fb.json +++ b/allure-report/data/test-cases/d0ce09c4ba5ff697.json @@ -1 +1 @@ -{"uid":"3f94de18ab2e95fb","name":"Non is expected","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_none","historyId":"262134764fa6664c0e3055da165452d3","time":{"start":1724735129461,"stop":1724735129461,"duration":0},"description":"\n If the whole array is consecutive then return\n null or Nothing or None.\n :return:\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"3c0afff932465669.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"d34aca89a8362e7c","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"d34aca89a8362e7c.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/f4fd5b9fa6dd3840.json b/allure-report/data/test-cases/d35364e5c638d89f.json
similarity index 71%
rename from allure-report/data/test-cases/f4fd5b9fa6dd3840.json
rename to allure-report/data/test-cases/d35364e5c638d89f.json
index 598e46a678e..487f1106b1b 100644
--- a/allure-report/data/test-cases/f4fd5b9fa6dd3840.json
+++ b/allure-report/data/test-cases/d35364e5c638d89f.json
@@ -1 +1 @@
-{"uid":"f4fd5b9fa6dd3840","name":"Negative numbers","fullName":"kyu_7.you_are_square.test_you_are_square.YouAreSquareTestCase#test_is_square_negative_numbers","historyId":"baeb278025592b3aed00b5f1bc1265b1","time":{"start":1724735129352,"stop":1724735129352,"duration":0},"description":"\n -1: Negative numbers cannot be square numbers\n :return:\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1732428194022,"stop":1732428194022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194025,"duration":2},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194025,"stop":1732428194025,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":6,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1732428194026,"stop":1732428194026,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c5f3069d223f82c6","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}},{"uid":"68ae9688c7c99a04","status":"passed","time":{"start":1724733472421,"stop":1724733472421,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2460353038ce1955","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}},{"uid":"afdaa298aab7eba8","status":"passed","time":{"start":1724735127282,"stop":1724735127282,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"2cc2dcb2d1d8eb43.json","parameterValues":[]} \ No newline at end of file +{"uid":"d36e2f5707d2a6d3","name":"Testing 'mix' function","fullName":"kyu_4.strings_mix.test_mix.MixTestCase#test_smix","historyId":"76cb71724bbc5595b66f218e2f828c5d","time":{"start":1732428194023,"stop":1732428194025,"duration":2},"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase","time":{"start":1732428194022,"stop":1732428194022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'mix' function\n\n Given two strings s1 and s2, the 'mix' function\n should visualize how different the two strings are.\n ","descriptionHtml":"Testing pmix function
Given two strings s1 and s2, the 'mix' function should visualize how different the two strings are. We will only take into account the lowercase letters (a to z). First let us count the frequency of each lowercase letters in s1 and s2.
","status":"passed","steps":[{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194023,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194023,"stop":1732428194025,"duration":2},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter s1 and s2 strings and assert the output vs expected result","time":{"start":1732428194025,"stop":1732428194025,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_MixTestCase::0","time":{"start":1732428194026,"stop":1732428194026,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Strings Mix"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strings_mix.test_mix"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5629db57620258aa9d000014","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"d36e2f5707d2a6d3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/284ee1b80abfdb89.json b/allure-report/data/test-cases/d39d2cfc8c05650c.json similarity index 59% rename from allure-report/data/test-cases/284ee1b80abfdb89.json rename to allure-report/data/test-cases/d39d2cfc8c05650c.json index 538466f052c..eb8c48f26b9 100644 --- a/allure-report/data/test-cases/284ee1b80abfdb89.json +++ b/allure-report/data/test-cases/d39d2cfc8c05650c.json @@ -1 +1 @@ -{"uid":"284ee1b80abfdb89","name":"'multiply' function verification","fullName":"kyu_8.multiply.test_multiply.MultiplyTestCase#test_multiply","historyId":"aa9027133335818366e5c0c91c936279","time":{"start":1732428196328,"stop":1732428196328,"duration":0},"description":"\n Verify that multiply function\n returns correct result\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194661,"stop":1732428194662,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Extend the list list","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c89e6a91bc0b9e52","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"23e61e29448b9218","status":"passed","time":{"start":1724733473155,"stop":1724733473155,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"826a0963540c6e75","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}},{"uid":"4359475f5ec554bd","status":"passed","time":{"start":1724735128047,"stop":1724735128047,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"5fabad9204d0747c.json","parameterValues":[]} \ No newline at end of file +{"uid":"d4941a73e9c93a57","name":"Testing 'DefaultList' class: extend","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_extend","historyId":"14f36f48218b5a6c45bb6c1fdb646e2d","time":{"start":1732428194661,"stop":1732428194663,"duration":2},"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732428194650,"stop":1732428194650,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: extend\n :return:\n ","descriptionHtml":"Testing extend method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732428194661,"stop":1732428194662,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Extend the list list","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732428194662,"stop":1732428194662,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732428194680,"stop":1732428194680,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"d4941a73e9c93a57.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d4a0809a7647965.json b/allure-report/data/test-cases/d4a0809a7647965.json deleted file mode 100644 index 67f7b552b4e..00000000000 --- a/allure-report/data/test-cases/d4a0809a7647965.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"d4a0809a7647965","name":"Testing decipher_this function","fullName":"kyu_6.decipher_this.test_decipher_this.DecipherThisTestCase#test_decipher_this","historyId":"ae3e8fd54712dd8496499b7bc14e7226","time":{"start":1732428194637,"stop":1732428194637,"duration":0},"description":"\n Testing decipher_this function\n :param self:\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1bfd50f00e4c2ad5","name":"stdout","source":"1bfd50f00e4c2ad5.txt","type":"text/plain","size":2817}],"parameters":[],"hasContent":true,"stepsCount":30,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"GAMES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"b9ab4feb44c59984.json","parameterValues":[]} \ No newline at end of file +{"uid":"d4d3736adb97380b","name":"Testing Sudoku class","fullName":"kyu_4.validate_sudoku_with_size.test_sudoku.SudokuTestCase#test_sudoku_class","historyId":"0704c8beeeff66cfb456c26853e2b7c4","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Sudoku class\n\n Given a Sudoku data structure with size NxN, N > 0 and √N == integer,\n assert a method that validates if it has been filled out correctly.\n :return:\n ","descriptionHtml":"Testing Sudoku class
Given a Sudoku data structure with size NxN, N > 0 and √N == integer, assert a method that validates if it has been filled out correctly.
","status":"passed","steps":[{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127422,"stop":1724735127422,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127422,"stop":1724735127438,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a Sudoku solution and verify if it a valid one.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert expected result vs actual.","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"9d7d21f763543a21","name":"stdout","source":"9d7d21f763543a21.txt","type":"text/plain","size":2817}],"parameters":[],"stepsCount":30,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SudokuTestCase::0","time":{"start":1724735127438,"stop":1724735127438,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"GAMES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Control Flow"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"VALIDATION"},{"name":"story","value":"Validate Sudoku with size `NxN`"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.validate_sudoku_with_size.test_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/540afbe2dc9f615d5e000425/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["GAMES","VALIDATION","PUZZLES","ALGORITHMS","ARRAYS"]},"source":"d4d3736adb97380b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d4f29bba77fd180.json b/allure-report/data/test-cases/d4f29bba77fd180.json new file mode 100644 index 00000000000..1ad34ac4f21 --- /dev/null +++ b/allure-report/data/test-cases/d4f29bba77fd180.json @@ -0,0 +1 @@ +{"uid":"d4f29bba77fd180","name":"Testing to_table function","fullName":"kyu_6.array_to_html_table.test_list_to_html_table.ArrayToTableTestCase#test_array_to_table_function","historyId":"d7b951f3d87d7ec30599f08ae5567eb7","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"description":"\n Testing to_table with various test data\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1732428194566,"stop":1732428194566,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing to_table with various test data\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732428194567,"stop":1732428194567,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1732428194569,"stop":1732428194569,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"LISTS"},{"name":"story","value":"Array to HTML table"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"d4f29bba77fd180.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/81c03b59fa01f666.json b/allure-report/data/test-cases/d50213dc9ab240ff.json similarity index 61% rename from allure-report/data/test-cases/81c03b59fa01f666.json rename to allure-report/data/test-cases/d50213dc9ab240ff.json index b0c48256e8e..03d5eca371a 100644 --- a/allure-report/data/test-cases/81c03b59fa01f666.json +++ b/allure-report/data/test-cases/d50213dc9ab240ff.json @@ -1 +1 @@ -{"uid":"81c03b59fa01f666","name":"Testing 'vaporcode' function","fullName":"kyu_7.vaporcode.test_vaporcode.VaporcodeTestCase#test_vaporcode","historyId":"91791ed1a852f76f936407ccb3d2dbaa","time":{"start":1724733474507,"stop":1724733474507,"duration":0},"description":"\n Testing 'vaporcode' function\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing binary_to_string function\n with various test data\n :return:\n ","descriptionHtml":"Test a function that takes in a binary string and returns the equivalent decoded text (the text is ASCII encoded).
","status":"passed","steps":[{"name":"Enter a binary (0100100001100101011011000110110001101111) and verify the expected output (Hello) vs actual result (Hello)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (00110001001100000011000100110001) and verify the expected output (1011) vs actual result (1011)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0101001101110000011000010111001001101011011100110010000001100110011011000110010101110111001011100010111000100000011001010110110101101111011101000110100101101111011011100111001100100000011100100110000101101110001000000110100001101001011001110110100000100001) and verify the expected output (Sparks flew.. emotions ran high!) vs actual result (Sparks flew.. emotions ran high!)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (0010000101000000001000110010010000100101010111100010011000101010001010000010100101010001010101110100010101110010011101000111100101010101010010010100111101001100011001000110011001100111011000100110001001101000011011100110110101001001010010110100001001001010010010110100100001001001010101010100111100101000001111110011111000111111001111000111111001111110011111100111111001111110001010010010100000101010001001100010010101011110001110010011100000110111001100010011001100101111001011010010111100101010001011010010101000101111) and verify the expected output (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/) vs actual result (!@#$%^&*()QWErtyUIOLdfgbbhnmIKBJKHIUO(?>?<~~~~~)(*&%^98713/-/*-*/)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a binary (011001100111011101101111001100010110001101101110001101100110011001101010011100010110010101110001) and verify the expected output (fwo1cn6fjqeq) vs actual result (fwo1cn6fjqeq)","time":{"start":1732428194577,"stop":1732428194577,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SequenceTestCase::0","time":{"start":1732428194580,"stop":1732428194580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"BINARY"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"FORMATS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Binary to Text (ASCII) Conversion"},{"name":"suite","value":"Character Encodings"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ASCII"},{"name":"tag","value":"CHARACTER ENCODINGS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.binary_to_text_ascii_conversion.test_binary_to_string"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5583d268479559400d000064","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","CHARACTER ENCODINGS","FUNDAMENTALS","FORMATS","BINARY","ASCII"]},"source":"d5360156ef396b6e.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d562abb8385a61c5.json b/allure-report/data/test-cases/d56667f6ac1424a3.json similarity index 64% rename from allure-report/data/test-cases/d562abb8385a61c5.json rename to allure-report/data/test-cases/d56667f6ac1424a3.json index ac4c0d7e05a..9994662d453 100644 --- a/allure-report/data/test-cases/d562abb8385a61c5.json +++ b/allure-report/data/test-cases/d56667f6ac1424a3.json @@ -1 +1 @@ -{"uid":"d562abb8385a61c5","name":"Testing two_decimal_places function","fullName":"kyu_7.formatting_decimal_places_1.test_two_decimal_places.TwoDecimalPlacesTestCase#test_two_decimal_places","historyId":"27ae718be00b2e9f316c37c338cb2894","time":{"start":1732428195826,"stop":1732428195826,"duration":0},"description":"\n Testing two_decimal_places function\n with various test inputs\n\n Each floating-point number should be\n formatted that only the first two\n decimal places are returned.\n\n You don't need to check whether the input\n is a valid number because only valid numbers\n are used in the tests.\n\n Don't round the numbers! Just cut them\n after two decimal places!\n\n :return:\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1732764218655,"stop":1732764218655,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing solution function\n ","descriptionHtml":"Testing permutations function
Test the solution so that it takes a list of integers in increasing order and returns a correctly formatted string in the range format.
","status":"passed","steps":[{"name":"Enter a test list ([-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]) and verify the output (-6,-3-1,3-5,7-11,14,15,17-20) vs expected (-6,-3-1,3-5,7-11,14,15,17-20)","time":{"start":1732764218655,"stop":1732764218655,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-3, -2, -1, 2, 10, 15, 16, 18, 19, 20]) and verify the output (-3--1,2,10,15,16,18-20) vs expected (-3--1,2,10,15,16,18-20)","time":{"start":1732764218655,"stop":1732764218655,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test list ([-91, -90, -87, -84, -81, -78, -77, -76, -74, -72, -70, -69, -66, -65, -63, -60, -58, -57, -54]) and verify the output (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54) vs expected (-91,-90,-87,-84,-81,-78--76,-74,-72,-70,-69,-66,-65,-63,-60,-58,-57,-54)","time":{"start":1732764218655,"stop":1732764218655,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1732764218656,"stop":1732764218656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRING"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Range Extraction"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"FORMATTING"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.range_extraction.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51ba717bb08c1cd60f00002f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"494bc5055e76bf71","status":"passed","time":{"start":1732428194006,"stop":1732428194008,"duration":2}},{"uid":"6558b0da7e100d83","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"747c525d425e0efa","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"a3395496d8bde803","status":"passed","time":{"start":1732428194006,"stop":1732428194008,"duration":2}},{"uid":"f80099cf6c294d2b","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}},{"uid":"99f691b62c390084","status":"passed","time":{"start":1724735127250,"stop":1724735127250,"duration":0}}]},"tags":["STRINGS","FORMATTING","STRING","ALGORITHMS"]},"source":"d5aba2cd944d7efd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3ffa72675847f113.json b/allure-report/data/test-cases/d5d01c4fe30779a0.json similarity index 54% rename from allure-report/data/test-cases/3ffa72675847f113.json rename to allure-report/data/test-cases/d5d01c4fe30779a0.json index 617329384ce..217d46603b0 100644 --- a/allure-report/data/test-cases/3ffa72675847f113.json +++ b/allure-report/data/test-cases/d5d01c4fe30779a0.json @@ -1 +1 @@ -{"uid":"3ffa72675847f113","name":"test_triangle","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_triangle","historyId":"be7068cb1056118b9c0776b1d187601d","time":{"start":1732428195758,"stop":1732428195759,"duration":1},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1732428195758,"stop":1732428195758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428195758,"stop":1732428195759,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1732428195762,"stop":1732428195762,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"tag","value":"Logic"},{"name":"suite","value":"Data Structures"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Algorithms"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"Strings"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a25ac6ac5e284cfbe000111","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"1a1c24c0cb125454","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"7e0d94f0ee4e397d","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}},{"uid":"2d65aaadaa20d5c2","status":"passed","time":{"start":1724735129039,"stop":1724735129039,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"3ffa72675847f113.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"d5d01c4fe30779a0","name":"test_triangle","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_triangle","historyId":"be7068cb1056118b9c0776b1d187601d","time":{"start":1732428195758,"stop":1732428195759,"duration":1},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1732428195758,"stop":1732428195758,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1732428195758,"stop":1732428195759,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1732428195762,"stop":1732428195762,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"tag","value":"Logic"},{"name":"suite","value":"Data Structures"},{"name":"parentSuite","value":"Beginner"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Algorithms"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"Strings"},{"name":"feature","value":"Lists"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5a25ac6ac5e284cfbe000111","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["Algorithms","Logic","Strings"]},"source":"d5d01c4fe30779a0.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/8dcfddf689f44d1d.json b/allure-report/data/test-cases/d64758690dcdce52.json
similarity index 75%
rename from allure-report/data/test-cases/8dcfddf689f44d1d.json
rename to allure-report/data/test-cases/d64758690dcdce52.json
index 3d3b7d7afc6..222faeaf8e8 100644
--- a/allure-report/data/test-cases/8dcfddf689f44d1d.json
+++ b/allure-report/data/test-cases/d64758690dcdce52.json
@@ -1 +1 @@
-{"uid":"8dcfddf689f44d1d","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"678cdbc81118a45c","name":"stdout","source":"678cdbc81118a45c.txt","type":"text/plain","size":562}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"8dcfddf689f44d1d.json","parameterValues":[]} \ No newline at end of file +{"uid":"d64758690dcdce52","name":"Testing agents_cleanup function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_agents_cleanup","historyId":"9af049da90f73c206ca7e8b1362e502f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named agents_cleanup where:\n - agents: is an array of agent coordinates\n - n: defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should remove all agents that are outside of the city boundaries.\n :return:\n ","descriptionHtml":"The function should remove all agents that are outside of the city boundaries.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"61785349fe52fbcf","name":"stdout","source":"61785349fe52fbcf.txt","type":"text/plain","size":562}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"d64758690dcdce52.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d6ad7a05187743ff.json b/allure-report/data/test-cases/d6ad7a05187743ff.json new file mode 100644 index 00000000000..26757c21166 --- /dev/null +++ b/allure-report/data/test-cases/d6ad7a05187743ff.json @@ -0,0 +1 @@ +{"uid":"d6ad7a05187743ff","name":"Testing 'letter_count' function","fullName":"kyu_6.count_letters_in_string.test_count_letters_in_string.CountLettersInStringTestCase#test_count_letters_in_string","historyId":"04bb543ec741bd163e341a33a1623692","time":{"start":1732764219308,"stop":1732764219309,"duration":1},"description":"\n Testing 'letter_count' function\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase","time":{"start":1732764221357,"stop":1732764221357,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for is_prime function testing\n :return:\n ","descriptionHtml":"Positive test cases for is_prime function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: True.","time":{"start":1732764221363,"stop":1732764221363,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsPrimeTestCase::0","time":{"start":1732764221363,"stop":1732764221363,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing is_prime util"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_is_prime"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"113e69c4ee0f071","status":"passed","time":{"start":1732428196489,"stop":1732428196489,"duration":0}},{"uid":"42452319aaa200ae","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"497e27a7f74365e8","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"62ef482e2cb3493b","status":"passed","time":{"start":1732428196489,"stop":1732428196489,"duration":0}},{"uid":"1b3bd0a5ea1aa072","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"2030ea00b6998f67","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"d731ec2306766d91.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/d7ea74c17659aeca.json b/allure-report/data/test-cases/d7ea74c17659aeca.json new file mode 100644 index 00000000000..86c9864f077 --- /dev/null +++ b/allure-report/data/test-cases/d7ea74c17659aeca.json @@ -0,0 +1 @@ +{"uid":"d7ea74c17659aeca","name":"Testing the 'unique_in_order' function","fullName":"kyu_6.unique_in_order.test_unique_in_order.UniqueInOrderTestCase#test_unique_in_order","historyId":"9cff2d5d4d73fbc92b1c7c29d738384f","time":{"start":1724733474116,"stop":1724733474116,"duration":0},"description":"\n Testing the 'unique_in_order' function\n with various test data\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ef1a5cba4efb343a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"a1b53b199c1c867e","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472312,"stop":1724733472312,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"cf3552eb00513a1a","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}},{"uid":"f4c5ff18f0370583","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127172,"stop":1724735127172,"duration":0}}]},"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"b7243d74fc99fb8b.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"d8bbfaabd5a5300d","name":"test_line_positive","fullName":"kyu_3.line_safari_is_that_a_line.test_line_positive.LinePositiveTestCase#test_line_positive","historyId":"0694e08a88ff80537fae0ce33871b5be","time":{"start":1732428193918,"stop":1732428193918,"duration":0},"description":"\n Testing Line Safari functionality\n Positive test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Positive test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_positive.py', 35, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"feature","value":"String"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_positive"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"d8bbfaabd5a5300d.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/2f4dd2b3858b1ec4.json b/allure-report/data/test-cases/d9bbc705106eff98.json
similarity index 69%
rename from allure-report/data/test-cases/2f4dd2b3858b1ec4.json
rename to allure-report/data/test-cases/d9bbc705106eff98.json
index a005236e5a6..8c92e076268 100644
--- a/allure-report/data/test-cases/2f4dd2b3858b1ec4.json
+++ b/allure-report/data/test-cases/d9bbc705106eff98.json
@@ -1 +1 @@
-{"uid":"2f4dd2b3858b1ec4","name":"Testing hoop_count function (negative test case)","fullName":"kyu_8.keep_up_the_hoop.test_hoop_count.HoopCountTestCase#test_hoop_count_negative","historyId":"89ee625343ed07ab852f830d9cc358b3","time":{"start":1724733474788,"stop":1724733474788,"duration":0},"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase","time":{"start":1724733474210,"stop":1724733474210,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"The function should take n (with: n>= 0) as parameter and must return the sum of the squares of the binomial coefficients on line n.
","status":"passed","steps":[{"name":"Enter line number (0) and assert expected (1) vs actual (1).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (1) and assert expected (2) vs actual (2).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (4) and assert expected (70) vs actual (70).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (7) and assert expected (3432) vs actual (3432).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (13) and assert expected (10400600) vs actual (10400600).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (17) and assert expected (2333606220) vs actual (2333606220).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (19) and assert expected (35345263800) vs actual (35345263800).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (22) and assert expected (2104098963720) vs actual (2104098963720).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (24) and assert expected (32247603683100) vs actual (32247603683100).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter line number (50) and assert expected (100891344545564193334812497256) vs actual (100891344545564193334812497256).","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"27790d440082a497","name":"stdout","source":"27790d440082a497.txt","type":"text/plain","size":554}],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_EasyLineTestCase::0","time":{"start":1724733474226,"stop":1724733474226,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Easy Line"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"NUMBERS"},{"name":"epic","value":"7 kyu"},{"name":"feature","value":"Math"},{"name":"subSuite","value":"Unit Tests"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.easy_line.test_easyline"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56e7d40129035aed6c000632/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"d9e7bf55554cd705.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/da02dcc2ce3c4d85.json b/allure-report/data/test-cases/da02dcc2ce3c4d85.json deleted file mode 100644 index 658de665038..00000000000 --- a/allure-report/data/test-cases/da02dcc2ce3c4d85.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"da02dcc2ce3c4d85","name":"'multiply' function verification with empty list","fullName":"kyu_7.remove_the_minimum.test_remove_the_minimum.RemoveSmallestTestCase#test_remove_smallest_empty_list","historyId":"15c98dd02f856858ef67a88bd3c8ad78","time":{"start":1732428195926,"stop":1732428195926,"duration":0},"description":"\n Test with empty list\n :return:\n ","descriptionHtml":"- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
- If the string already ends with a number, the number should be incremented by 1.
- If the string does not end with a number. the number 1 should be appended to the new string.
Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase","time":{"start":1732428194179,"stop":1732428194179,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing done_or_not function\n\n Testing a function done_or_not/DoneOrNot passing a board\n (list[list_lines]) as parameter. If the board is valid return\n 'Finished!', otherwise return 'Try again!'\n :return:\n ","descriptionHtml":"Testing a function done_or_not/DoneOrNot passing a board (list[list_lines]) as parameter. If the board is valid return 'Finished!', otherwise return 'Try again!'
","status":"passed","steps":[{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter sudoku and verify the output.","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DidIFinishedSudokuTestCase::0","time":{"start":1732428194180,"stop":1732428194180,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Did I Finish my Sudoku?"},{"name":"tag","value":"LOOPS"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"feature","value":"Control Flow"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.did_i_finish_my_sudoku.test_did_i_finish_sudoku"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/53db96041f1a7d32dc0004d2","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","CONTROL FLOW","PUZZLES","BASIC LANGUAGE FEATURES","ALGORITHMS","LOOPS","DATA STRUCTURES"]},"source":"dc89f010c8fc632.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5a497340f38e6588.json b/allure-report/data/test-cases/dc9bdff2273b81f8.json similarity index 64% rename from allure-report/data/test-cases/5a497340f38e6588.json rename to allure-report/data/test-cases/dc9bdff2273b81f8.json index 6e44e4075e9..b19f43b7c79 100644 --- a/allure-report/data/test-cases/5a497340f38e6588.json +++ b/allure-report/data/test-cases/dc9bdff2273b81f8.json @@ -1 +1 @@ -{"uid":"5a497340f38e6588","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724735129008,"stop":1724735129024,"duration":16},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f1a162618bd1b29d","name":"stdout","source":"f1a162618bd1b29d.txt","type":"text/plain","size":167}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"5a497340f38e6588.json","parameterValues":[]} \ No newline at end of file +{"uid":"dc9bdff2273b81f8","name":"Testing calculate function","fullName":"kyu_7.basic_math_add_or_subtract.test_calculate.CalculateTestCase#test_calculate","historyId":"bd0f38e5388cf4a636a9393d435770b8","time":{"start":1724735129008,"stop":1724735129024,"duration":16},"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"In this kata, you will do addition and subtraction on a given string. The return value must be also a string.
","status":"passed","steps":[{"name":"Enter string (1plus2plus3plus4) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1minus2minus3minus4) and verify the expected output (-8) vs actual result (-8)","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (1plus2plus3minus4) and verify the expected output (2) vs actual result (2)","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1342cdaa6481456c","name":"stdout","source":"1342cdaa6481456c.txt","type":"text/plain","size":167}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129024,"stop":1724735129024,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Basic Math (Add or Subtract)"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.basic_math_add_or_subtract.test_calculate"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5809b62808ad92e31b000031/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"dc9bdff2273b81f8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/dcee0c4d2268b964.json b/allure-report/data/test-cases/dcee0c4d2268b964.json deleted file mode 100644 index 43f2bb89772..00000000000 --- a/allure-report/data/test-cases/dcee0c4d2268b964.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"dcee0c4d2268b964","name":"Testing zeros function","fullName":"kyu_5.number_of_trailing_zeros_of_n.test_zeros.ZerosTestCase#test_zeros","historyId":"bf37412e0e610d07d951e5fde674ec97","time":{"start":1724733472968,"stop":1724733472968,"duration":0},"description":"\n Testing 'zeros' program that should calculate the number\n of trailing zeros in a factorial of a given number.\n :return: None\n ","descriptionHtml":"Test a function that processes sequence of jobs and returns a positive integer representing the cc ittakes to complete the job at index.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SJFTestCase","time":{"start":1732764220300,"stop":1732764220300,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'shortest_job_first' function with various test data\n :return:\n ","descriptionHtml":"Test a function that processes sequence of jobs and returns a positive integer representing the cc ittakes to complete the job at index.
","status":"passed","steps":[{"name":"Enter a n (([0], 0)) and verify the expected output (100) vs actual result (100)","time":{"start":1732764220303,"stop":1732764220303,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 10, 20, 0, 0], 0)) and verify the expected output (6) vs actual result (6)","time":{"start":1732764220303,"stop":1732764220303,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 0, 20, 0, 0], 1)) and verify the expected output (16) vs actual result (16)","time":{"start":1732764220303,"stop":1732764220303,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 0, 10, 20, 0, 0], 1)) and verify the expected output (16) vs actual result (16)","time":{"start":1732764220303,"stop":1732764220303,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 0, 0, 20, 0, 0], 2)) and verify the expected output (26) vs actual result (26)","time":{"start":1732764220303,"stop":1732764220303,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([20, 20, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 19, 0, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 20, 0, 19, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 18, 0, 0], 75)) and verify the expected output (1008) vs actual result (1008)","time":{"start":1732764220303,"stop":1732764220303,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a n (([0, 13, 13, 12, 17, 0, 15, 0, 12, 0, 15, 0, 0, 12, 19, 11, 10, 0, 11, 18, 0, 0, 15, 20, 0, 16, 12, 17, 0, 0, 10, 19, 0, 9, 0, 16, 19, 16, 15, 0, 17, 0, 13, 11, 19, 18, 13, 10, 0, 20, 0, 10, 9, 18, 14, 18, 0, 15, 17, 10, 17, 0, 0, 0, 18, 0, 0, 19, 14, 0, 0, 19, 19, 0, 0, 0, 0, 0, 9, 18, 0, 0, 11, 16, 0, 0, 0, 0, 10, 0, 17, 0, 16, 0, 0, 0, 16, 0, 13, 20, 0, 20, 20, 0, 0, 20, 14, 0, 11, 0, 9, 0, 0, 20, 11, 17, 0, 12, 13, 16, 13, 19, 0, 18, 20, 0, 19, 10, 19, 12, 0, 18, 0, 14, 9, 0, 0, 0, 13, 14, 9, 18, 9, 11, 19, 10, 20, 17, 13, 0, 13, 0, 12, 0, 19, 0, 14, 0, 20, 0, 14, 12, 11, 18, 0, 0, 9, 0, 19], 24)) and verify the expected output (275) vs actual result (275)","time":{"start":1732764220303,"stop":1732764220303,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SJFTestCase::0","time":{"start":1732764220305,"stop":1732764220305,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"Scheduling (Shortest Job First or SJF)"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"QUEUES"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"feature","value":"Algorithms"},{"name":"tag","value":"SCHEDULING"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.scheduling.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550cc572b9e7b563be00054f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"cbe27b4f7111917c","status":"passed","time":{"start":1732428195625,"stop":1732428195626,"duration":1}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":2,"unknown":0,"total":2},"items":[{"uid":"a224a931a5567f85","status":"passed","time":{"start":1732428195625,"stop":1732428195626,"duration":1}}]},"tags":["SCHEDULING","QUEUES","ALGORITHMS"]},"source":"dd86378e3a37dfe4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/843ad9a1e8e9ca65.json b/allure-report/data/test-cases/de09867d078b6af4.json similarity index 70% rename from allure-report/data/test-cases/843ad9a1e8e9ca65.json rename to allure-report/data/test-cases/de09867d078b6af4.json index 9a6b6b9e146..e33e794a2c7 100644 --- a/allure-report/data/test-cases/843ad9a1e8e9ca65.json +++ b/allure-report/data/test-cases/de09867d078b6af4.json @@ -1 +1 @@ -{"uid":"843ad9a1e8e9ca65","name":"Test with regular string","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings","historyId":"12f0f975ccfd38a2860e83db6017e19f","time":{"start":1724735129649,"stop":1724735129649,"duration":0},"description":"\n Test with regular string\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Assert that 'domain_name' function\n returns domain name from given URL string.\n\n :return:\n ","descriptionHtml":"Assert that 'domain_name' function returns domain name from given URL string.
","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string and verify the output","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2c51ebffe286fde1","name":"stdout","source":"2c51ebffe286fde1.txt","type":"text/plain","size":263}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DomainNameTestCase::0","time":{"start":1724735127500,"stop":1724735127500,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DECLARATIVE PROGRAMMING"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ADVANCED LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"story","value":"Extract the domain name from a URL"},{"name":"tag","value":"REGULAR EXPRESSIONS"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.extract_the_domain_name_from_url.test_domain_name"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/514a024011ea4fb54200004b/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","PARSING","ADVANCED LANGUAGE FEATURES","DECLARATIVE PROGRAMMING","ALGORITHMS","REGULAR EXPRESSIONS"]},"source":"e0d2f09c0da8121.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/47bce28013711283.json b/allure-report/data/test-cases/e0e01cfda157cf01.json similarity index 74% rename from allure-report/data/test-cases/47bce28013711283.json rename to allure-report/data/test-cases/e0e01cfda157cf01.json index 30b149bc596..bb17c8de4de 100644 --- a/allure-report/data/test-cases/47bce28013711283.json +++ b/allure-report/data/test-cases/e0e01cfda157cf01.json @@ -1 +1 @@ -{"uid":"47bce28013711283","name":"Testing pig_it function","fullName":"kyu_5.simple_pig_latin.test_pig_it.PigItTestCase#test_pig_it","historyId":"c5f1cfe64ff8d3a4f16a4166c571797e","time":{"start":1724733472983,"stop":1724733472983,"duration":0},"description":"\n Testing pig_it function\n\n The function should mpve the first letter of each\n word to the end of it, then add \"ay\" to the end\n of the word. Leave punctuation marks untouched.\n :return:\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1732428194511,"stop":1732428194511,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1732428194512,"stop":1732428194512,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1732428194513,"stop":1732428194513,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MEMOIZATION"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"997065a61e801d4c","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}},{"uid":"b4abfaf3d77f3f23","status":"passed","time":{"start":1724733472999,"stop":1724733472999,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"2965d2d3db0ea08e","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}},{"uid":"be5a8376fdcba717","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}}]},"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"607f84fe70696eb5.json","parameterValues":[]} \ No newline at end of file +{"uid":"e248ed6a4ff28aaa","name":"Testing done_or_not function","fullName":"kyu_5.sum_of_pairs.test_sum_pairs.SumPairsTestCase#test_sum_pairs","historyId":"9fee131d815f560a33f2993b7a094489","time":{"start":1732428194512,"stop":1732428194512,"duration":0},"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1732428194511,"stop":1732428194511,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1732428194512,"stop":1732428194512,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1732428194513,"stop":1732428194513,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"story","value":"Sum of Pairs"},{"name":"feature","value":"Memoization"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"MEMOIZATION"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"e248ed6a4ff28aaa.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e29868febcecd61d.json b/allure-report/data/test-cases/e29868febcecd61d.json new file mode 100644 index 00000000000..40089d6b756 --- /dev/null +++ b/allure-report/data/test-cases/e29868febcecd61d.json @@ -0,0 +1 @@ +{"uid":"e29868febcecd61d","name":"get_size function tests","fullName":"kyu_8.surface_area_and_volume_of_box.test_get_size.GetSizeTestCase#test_get_size","historyId":"ecc1f7419b2f77621f5c909f1d0df9a9","time":{"start":1724735129664,"stop":1724735129664,"duration":0},"description":"\n Testing get_size function with various inputs\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a9f925f082e601ea","name":"stdout","source":"a9f925f082e601ea.txt","type":"text/plain","size":23}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"6373ea673c2617a2.json","parameterValues":[]} \ No newline at end of file +{"uid":"e2a8e239adf783da","name":"Negative test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_negative","historyId":"4a2df53975623c10d30ec1c6932ba04a","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1724733475022,"stop":1724733475022,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"b3d868139d71d5f7","name":"stdout","source":"b3d868139d71d5f7.txt","type":"text/plain","size":23}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1724733475038,"stop":1724733475038,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"suite","value":"No kyu helper methods"},{"name":"parentSuite","value":"Helper methods"},{"name":"story","value":"Testing gen_primes util"},{"name":"feature","value":"Utils"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"UTILS"},{"name":"epic","value":"No kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"e2a8e239adf783da.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/419686fbcf063822.json b/allure-report/data/test-cases/e2ed60d0ac53c788.json similarity index 56% rename from allure-report/data/test-cases/419686fbcf063822.json rename to allure-report/data/test-cases/e2ed60d0ac53c788.json index 5632569e629..4355764b638 100644 --- a/allure-report/data/test-cases/419686fbcf063822.json +++ b/allure-report/data/test-cases/e2ed60d0ac53c788.json @@ -1 +1 @@ -{"uid":"419686fbcf063822","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1732428195989,"stop":1732428195989,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1732428195991,"stop":1732428195991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sum of odd numbers"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"302b8c55161cc361","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}},{"uid":"8c72192846448826","status":"passed","time":{"start":1724733474460,"stop":1724733474460,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"9a325845218dd6ae","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}},{"uid":"d837297408a13c1e","status":"passed","time":{"start":1724735129274,"stop":1724735129274,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"419686fbcf063822.json","parameterValues":[]} \ No newline at end of file +{"uid":"e2ed60d0ac53c788","name":"Testing row_sum_odd_numbers function","fullName":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers.OddRowTestCase#test_row_sum_odd_numbers","historyId":"b85aee9ae2ee06fc56de8481df862c73","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase","time":{"start":1732428195989,"stop":1732428195989,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing the function with various test data\n :return:\n ","descriptionHtml":"Given the triangle of consecutive odd numbers verify that the function calculates the row sums of this triangle from the row index (starting at index 1)
","status":"passed","steps":[{"name":"Enter the triangle's row (1) and verify the expected output (1) vs actual result (1)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (2) and verify the expected output (8) vs actual result (8)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (13) and verify the expected output (2197) vs actual result (2197)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (19) and verify the expected output (6859) vs actual result (6859)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter the triangle's row (41) and verify the expected output (68921) vs actual result (68921)","time":{"start":1732428195990,"stop":1732428195990,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_OddRowTestCase::0","time":{"start":1732428195991,"stop":1732428195991,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Sum of odd numbers"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"ARITHMETIC"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.sum_of_odd_numbers.test_row_sum_odd_numbers"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55fd2d567d94ac3bc9000064","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","LISTS","NUMBERS","ARITHMETIC","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"e2ed60d0ac53c788.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e330dbdee7dc6874.json b/allure-report/data/test-cases/e330dbdee7dc6874.json deleted file mode 100644 index 30e6321bbb9..00000000000 --- a/allure-report/data/test-cases/e330dbdee7dc6874.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"e330dbdee7dc6874","name":"Testing string_to_array function","fullName":"kyu_8.convert_string_to_an_array.test_string_to_array.StringToArrayTestCase#test_string_to_array","historyId":"f51ecfb2c4460f518b2155a78436a09d","time":{"start":1724735129399,"stop":1724735129399,"duration":0},"description":"\n Testing string_to_array function.\n\n A function to split a string and\n convert it into an array of words.\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1732764220312,"stop":1732764220312,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220312,"stop":1732764220312,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220312,"stop":1732764220312,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220312,"stop":1732764220312,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1732764220314,"stop":1732764220314,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"f6df3cbfc02e5094","status":"passed","time":{"start":1732428195634,"stop":1732428195634,"duration":0}},{"uid":"afe0c9a0972467a3","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}},{"uid":"fe040c66880e0b15","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"fc455123cb448d3e","status":"passed","time":{"start":1732428195634,"stop":1732428195634,"duration":0}},{"uid":"31cd5c9e8017f83c","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}},{"uid":"1ef3e1da7f90eb82","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}}]},"tags":["FUNDAMENTALS","ARRAYS"]},"source":"e53952640c2c9e47.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f91e38b8c375d31c.json b/allure-report/data/test-cases/e55f716219844475.json similarity index 59% rename from allure-report/data/test-cases/f91e38b8c375d31c.json rename to allure-report/data/test-cases/e55f716219844475.json index cfbfc2de1a0..346a82624de 100644 --- a/allure-report/data/test-cases/f91e38b8c375d31c.json +++ b/allure-report/data/test-cases/e55f716219844475.json @@ -1 +1 @@ -{"uid":"f91e38b8c375d31c","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"description":"\n Testing calculate_damage with various test data\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing calculate_damage with various test data\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":7,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1732428195581,"stop":1732428195581,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Games"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"2b5bdabfec79d6cf","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"85284c487c263073","status":"passed","time":{"start":1724733474023,"stop":1724733474023,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"90a24ba96aea3cfc","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"396df158495e2556","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"f91e38b8c375d31c.json","parameterValues":[]} \ No newline at end of file +{"uid":"e55f716219844475","name":"Testing calculate_damage function","fullName":"kyu_6.pokemon_damage_calculator.test_calculate_damage.CalculateDamageTestCase#test_calculate_damage","historyId":"999238307e14499484c6cdf395220c6b","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"description":"\n Testing calculate_damage with various test data\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing calculate_damage with various test data\n :return:\n ","descriptionHtml":"Verify that the function calculates the damage that a particular move would do using the following formula (not the actual one from the game): damage = 50 * (attack / defense) * effectiveness
","status":"passed","steps":[{"name":"Enter a test data (('fire', 'water', 100, 100)) and verify the expected output (25) vs actual result (25.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 100, 100)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('electric', 'fire', 100, 100)) and verify the expected output (50) vs actual result (50.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'electric', 57, 19)) and verify the expected output (150) vs actual result (150.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'water', 40, 40)) and verify the expected output (100) vs actual result (100.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('grass', 'fire', 35, 5)) and verify the expected output (175) vs actual result (175.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data (('fire', 'electric', 10, 2)) and verify the expected output (250) vs actual result (250.0)","time":{"start":1732428195580,"stop":1732428195580,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":7,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateDamageTestCase::0","time":{"start":1732428195581,"stop":1732428195581,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"FUNCTIONS"},{"name":"feature","value":"Numbers"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"CONTROL FLOW"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"PUZZLES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Games"},{"name":"parentSuite","value":"Novice"},{"name":"story","value":"Pokemon Damage Calculator"},{"name":"tag","value":"GAMES"},{"name":"tag","value":"ARRAYS"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.pokemon_damage_calculator.test_calculate_damage"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/536e9a7973130a06eb000e9f","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS","NUMBERS","CONTROL FLOW","GAMES","PUZZLES","BASIC LANGUAGE FEATURES","FUNCTIONS","ARRAYS"]},"source":"e55f716219844475.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1a1c24c0cb125454.json b/allure-report/data/test-cases/e5a7c04cf0e6c2f9.json similarity index 68% rename from allure-report/data/test-cases/1a1c24c0cb125454.json rename to allure-report/data/test-cases/e5a7c04cf0e6c2f9.json index 6b59f700121..1ee39edae77 100644 --- a/allure-report/data/test-cases/1a1c24c0cb125454.json +++ b/allure-report/data/test-cases/e5a7c04cf0e6c2f9.json @@ -1 +1 @@ -{"uid":"1a1c24c0cb125454","name":"test_triangle","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_triangle","historyId":"be7068cb1056118b9c0776b1d187601d","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"cece8653b698fb5f","name":"stdout","source":"cece8653b698fb5f.txt","type":"text/plain","size":1079}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"Strings"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Logic"},{"name":"tag","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["Algorithms","Logic","Strings"]},"source":"1a1c24c0cb125454.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"e5a7c04cf0e6c2f9","name":"test_triangle","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_triangle","historyId":"be7068cb1056118b9c0776b1d187601d","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"8778cf7e4eef01cb","name":"stdout","source":"8778cf7e4eef01cb.txt","type":"text/plain","size":1079}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724735129039,"stop":1724735129039,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Lists"},{"name":"tag","value":"Strings"},{"name":"parentSuite","value":"Beginner"},{"name":"suite","value":"Data Structures"},{"name":"story","value":"Coloured Triangles"},{"name":"tag","value":"Logic"},{"name":"tag","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["Algorithms","Logic","Strings"]},"source":"e5a7c04cf0e6c2f9.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/e5b1f301926fe23.json b/allure-report/data/test-cases/e5b1f301926fe23.json
deleted file mode 100644
index 9aec610f98b..00000000000
--- a/allure-report/data/test-cases/e5b1f301926fe23.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"e5b1f301926fe23","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1732428194170,"stop":1732428194170,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"PARSING"},{"name":"story","value":"Count IP Addresses"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"945a96aedc88e8fe","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"a3216b951d3fac8b","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472561,"stop":1724733472561,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"1dee8c06fd165199","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}},{"uid":"e5ac2209dd79eabb","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127453,"stop":1724735127453,"duration":0}}]},"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"e5b1f301926fe23.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/9b5127c91b9deeb6.json b/allure-report/data/test-cases/e5d70f307aec9205.json
similarity index 54%
rename from allure-report/data/test-cases/9b5127c91b9deeb6.json
rename to allure-report/data/test-cases/e5d70f307aec9205.json
index 59e2b43d482..92899d8fe21 100644
--- a/allure-report/data/test-cases/9b5127c91b9deeb6.json
+++ b/allure-report/data/test-cases/e5d70f307aec9205.json
@@ -1 +1 @@
-{"uid":"9b5127c91b9deeb6","name":"Testing 'generate_hashtag' function","fullName":"kyu_5.the_hashtag_generator.test_generate_hashtag.GenerateHashtagTestCase#test_generate_hashtag","historyId":"ff2324e4a058a6c42486fd5aff532ecf","time":{"start":1732428194518,"stop":1732428194518,"duration":0},"description":"\n Testing 'generate_hashtag' function\n ","descriptionHtml":"The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
The function should do the following:
1. It must start with a hashtag (#).
2. All words must have their first letter capitalized.
3. If the final result is longer than 140 chars it must return false.
4. If the input or the result is an empty string it must return false.
Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1732764218682,"stop":1732764218682,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1732764218683,"stop":1732764218683,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1732764218683,"stop":1732764218683,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1732764218685,"stop":1732764218685,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Strip Comments"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"ec528f5ba60e276b","status":"passed","time":{"start":1732428194032,"stop":1732428194032,"duration":0}},{"uid":"395a8f7cfcd6a2c9","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}},{"uid":"3400d1d080e82f75","status":"passed","time":{"start":1724733472421,"stop":1724733472437,"duration":16}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"4b8219eb37520d2d","status":"passed","time":{"start":1732428194032,"stop":1732428194032,"duration":0}},{"uid":"f711bbcd16ab2119","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}},{"uid":"5c64823a2a73f974","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"e604a93a8ee1253f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/33bc4a62afa9ed1a.json b/allure-report/data/test-cases/e63c100babc1267d.json similarity index 78% rename from allure-report/data/test-cases/33bc4a62afa9ed1a.json rename to allure-report/data/test-cases/e63c100babc1267d.json index c92e54a0eef..a39e56920c3 100644 --- a/allure-report/data/test-cases/33bc4a62afa9ed1a.json +++ b/allure-report/data/test-cases/e63c100babc1267d.json @@ -1 +1 @@ -{"uid":"33bc4a62afa9ed1a","name":"Testing make_readable function","fullName":"kyu_5.human_readable_time.test_make_readable.MakeReadableTestCase#test_make_readable","historyId":"ca529ab6c57db539179bf256595c3d50","time":{"start":1724733472780,"stop":1724733472780,"duration":0},"description":"\n Testing make_readable function\n\n Write a function, which takes a non-negative integer\n (seconds) as input and returns the time in a human-readable\n format (HH:MM:SS)\n\n HH = hours, padded to 2 digits, range: 00 - 99\n MM = minutes, padded to 2 digits, range: 00 - 59\n SS = seconds, padded to 2 digits, range: 00 - 59\n\n The maximum time never exceeds 359999 (99:59:59)\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1732764219250,"stop":1732764219250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing to_table with various test data\n :return:\n ","descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219250,"stop":1732764219250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219250,"stop":1732764219250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219250,"stop":1732764219250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219250,"stop":1732764219250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1732764219251,"stop":1732764219251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1732764219252,"stop":1732764219252,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Array to HTML table"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"d4f29bba77fd180","status":"passed","time":{"start":1732428194567,"stop":1732428194567,"duration":0}},{"uid":"c0b9bbb0a9f351b0","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"fa5cd4b7c764fede","status":"passed","time":{"start":1724733473077,"stop":1724733473077,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"40c938f8f83f34f7","status":"passed","time":{"start":1732428194567,"stop":1732428194567,"duration":0}},{"uid":"e6a3da330525d2f4","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}},{"uid":"b78c37ec3b0f496f","status":"passed","time":{"start":1724735127969,"stop":1724735127969,"duration":0}}]},"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"e687a692c2c18f1b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/a076808e43574371.json b/allure-report/data/test-cases/e695b3f4b0bdd51b.json similarity index 63% rename from allure-report/data/test-cases/a076808e43574371.json rename to allure-report/data/test-cases/e695b3f4b0bdd51b.json index f5a17b61689..3c4eaf29479 100644 --- a/allure-report/data/test-cases/a076808e43574371.json +++ b/allure-report/data/test-cases/e695b3f4b0bdd51b.json @@ -1 +1 @@ -{"uid":"a076808e43574371","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"65c05475b72ce468","name":"stdout","source":"65c05475b72ce468.txt","type":"text/plain","size":242}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"c7eea171ede7ee13","status":"passed","time":{"start":1724733474288,"stop":1724733474288,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"a492d74df14be54a","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}},{"uid":"c11bd2bbb0f17cd9","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"a076808e43574371.json","parameterValues":[]} \ No newline at end of file +{"uid":"e695b3f4b0bdd51b","name":"Testing count_letters_and_digits function","fullName":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits.CalculateTestCase#test_calculate","historyId":"a9a9cea93ff72e09882edc4b831ce933","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":1,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test a method that can determine how many letters and digits are in a given string.
","status":"passed","steps":[{"name":"Enter string (n!!ice!!123) and verify the expected output (7) vs actual result (7)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (de?=?=tttes!!t) and verify the expected output (8) vs actual result (8)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string () and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (!@#$%^&`~.) and verify the expected output (0) vs actual result (0)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter string (u_n_d_e_r__S_C_O_R_E) and verify the expected output (10) vs actual result (10)","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"850bcf9305b7e315","name":"stdout","source":"850bcf9305b7e315.txt","type":"text/plain","size":242}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_CalculateTestCase::0","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Help Bob count letters and digits."},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.help_bob_count_letters_and_digits.test_count_letters_and_digits"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5738f5ea9545204cec000155/train/python","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"a8ee14a37e5c3cb6","status":"passed","time":{"start":1724733474288,"stop":1724733474288,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"a076808e43574371","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}},{"uid":"a492d74df14be54a","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}},{"uid":"c11bd2bbb0f17cd9","status":"passed","time":{"start":1724735129133,"stop":1724735129133,"duration":0}}]},"tags":["STRINGS","FUNDAMENTALS"]},"source":"e695b3f4b0bdd51b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e0f78ca1d7d1823c.json b/allure-report/data/test-cases/e6abe3c64e54cb9f.json similarity index 67% rename from allure-report/data/test-cases/e0f78ca1d7d1823c.json rename to allure-report/data/test-cases/e6abe3c64e54cb9f.json index 1ee897a9244..f6fdc06f923 100644 --- a/allure-report/data/test-cases/e0f78ca1d7d1823c.json +++ b/allure-report/data/test-cases/e6abe3c64e54cb9f.json @@ -1 +1 @@ -{"uid":"e0f78ca1d7d1823c","name":"Testing swap_values function","fullName":"kyu_8.swap_values.test_swap_values.SwapValuesTestCase#test_swap_values","historyId":"3546afa49f7d1872d60856dcd3614357","time":{"start":1724733474913,"stop":1724733474913,"duration":0},"description":"\n Testing swap_values function\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase","time":{"start":1732764218663,"stop":1732764218663,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'snail' function\n\n Given an n x n array, 'snail' function should return the array\n elements arranged from outermost elements to the middle element,\n traveling clockwise.\n ","descriptionHtml":"Verify that 'snail' function returns the array elements arranged from outermost elements to the middle element, traveling clockwise
","status":"passed","steps":[{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732764218663,"stop":1732764218663,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732764218663,"stop":1732764218663,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732764218663,"stop":1732764218663,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732764218663,"stop":1732764218663,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test array and verify the output vs expected result","time":{"start":1732764218663,"stop":1732764218663,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SnailTestCase::0","time":{"start":1732764218665,"stop":1732764218665,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Snail"},{"name":"tag","value":"ARRAYS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.snail.test_snail"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"b054542ab329d2ac","status":"passed","time":{"start":1732428194015,"stop":1732428194015,"duration":0}},{"uid":"b7874e896ca052d2","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}},{"uid":"3f3bfc03f90689c3","status":"passed","time":{"start":1724733472405,"stop":1724733472405,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"461527a27e50c04a","status":"passed","time":{"start":1732428194015,"stop":1732428194015,"duration":0}},{"uid":"95ddc175910ea52","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}},{"uid":"16026a681cee6bae","status":"passed","time":{"start":1724735127266,"stop":1724735127266,"duration":0}}]},"tags":["LISTS","ALGORITHMS","ARRAYS"]},"source":"e7035dc3ef8d99c0.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/bd4541daca134967.json b/allure-report/data/test-cases/e71092ad871851c8.json similarity index 56% rename from allure-report/data/test-cases/bd4541daca134967.json rename to allure-report/data/test-cases/e71092ad871851c8.json index 00f4830c445..38b13b8f340 100644 --- a/allure-report/data/test-cases/bd4541daca134967.json +++ b/allure-report/data/test-cases/e71092ad871851c8.json @@ -1 +1 @@ -{"uid":"bd4541daca134967","name":"XOR logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_xor","historyId":"80fa996da1344642e95c3c1d2f315df1","time":{"start":1732428196311,"stop":1732428196312,"duration":1},"description":"\n Exclusive or or exclusive disjunction is a\n logical operation that outputs true only when\n inputs differ (one is true, the other is false).\n\n XOR outputs true whenever the inputs differ:\n\n Source:\n https://en.wikipedia.org/wiki/Exclusive_or\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":14,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1732428194165,"stop":1732428194165,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"LANGUAGE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"feature","value":"String"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FEATURES"},{"name":"tag","value":"PROGRAMMING"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"13ca3a7cd8b0e3af","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}},{"uid":"4c7e13d0f61cf99a","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"ace382695affabdf","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}},{"uid":"aca9d99cb0e5842e","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}}]},"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","FUNDAMENTALS","PROGRAMMING","ADVANCED","FEATURES"]},"source":"5d8c14adba840438.json","parameterValues":[]} \ No newline at end of file +{"uid":"e776a97a9aadedfc","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1732428194163,"stop":1732428194163,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":14,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1732428194165,"stop":1732428194165,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ADVANCED"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"LANGUAGE"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"feature","value":"String"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"FEATURES"},{"name":"tag","value":"PROGRAMMING"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LANGUAGE","STRINGS","DECLARATIVE","EXPRESSIONS","REGULAR","FUNDAMENTALS","PROGRAMMING","ADVANCED","FEATURES"]},"source":"e776a97a9aadedfc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/c7c4b4c39dca1f7a.json b/allure-report/data/test-cases/e78a552d574aad16.json similarity index 64% rename from allure-report/data/test-cases/c7c4b4c39dca1f7a.json rename to allure-report/data/test-cases/e78a552d574aad16.json index d1a17570def..9a4643c4b95 100644 --- a/allure-report/data/test-cases/c7c4b4c39dca1f7a.json +++ b/allure-report/data/test-cases/e78a552d574aad16.json @@ -1 +1 @@ -{"uid":"c7c4b4c39dca1f7a","name":"Testing alphanumeric function","fullName":"kyu_5.not_very_secure.test_alphanumeric.AlphanumericTestCase#test_alphanumeric","historyId":"e4b3b27b629bbd5f25abab144f66de37","time":{"start":1732428194471,"stop":1732428194471,"duration":0},"description":"\n Testing alphanumeric function with\n various test inputs\n\n The string has the following conditions\n to be alphanumeric only\n\n 1. At least one character (\"\" is not valid)\n 2. Allowed characters are uppercase or lowercase\n latin letters and digits from 0 to 9\n 3. No whitespaces or underscore or special chars\n\n :return: None\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Insert items to the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f24a9f86ff4ef095","name":"stdout","source":"f24a9f86ff4ef095.txt","type":"text/plain","size":261}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"693d19da33d622de.json","parameterValues":[]} \ No newline at end of file +{"uid":"e8a3e54ef5fe796f","name":"Testing 'DefaultList' class: insert","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_insert","historyId":"f3667cd9a93528eccefa1ce200cedfa2","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724733473139,"stop":1724733473139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Insert items to the list","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724733473171,"stop":1724733473171,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"4e693ea1a91f61ae","name":"stdout","source":"4e693ea1a91f61ae.txt","type":"text/plain","size":261}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724733473186,"stop":1724733473186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"story","value":"DefaultList"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"CLASSES"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"e8a3e54ef5fe796f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e91954f86960f5cf.json b/allure-report/data/test-cases/e91954f86960f5cf.json new file mode 100644 index 00000000000..00f47ebd70a --- /dev/null +++ b/allure-report/data/test-cases/e91954f86960f5cf.json @@ -0,0 +1 @@ +{"uid":"e91954f86960f5cf","name":"Testing alphabet_war function","fullName":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war.AlphabetWarTestCase#test_alphabet_war","historyId":"10af3a5c9f6fb077c8237771f4b70e20","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase","time":{"start":1732764218818,"stop":1732764218819,"duration":1},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing alphabet_war function\n\n Introduction\n There is a war and nobody knows - the alphabet war!\n The letters hide in their nuclear shelters. The\n nuclear strikes hit the battlefield and killed a\n lot of them.\n\n Task\n Write a function that accepts battlefield string\n and returns letters that survived the nuclear strike.\n\n 1. The battlefield string consists of only small letters, #,[ and ].\n\n 2. The nuclear shelter is represented by square brackets [].\n The letters inside the square brackets represent letters\n inside the shelter.\n\n 3. The # means a place where nuclear strike hit the battlefield.\n If there is at least one # on the battlefield, all letters outside\n of shelter die. When there is no any # on the battlefield, all letters\n survive (but do not expect such scenario too often ;-P ).\n\n 4. The shelters have some durability. When 2 or more # hit close to\n the shelter, the shelter is destroyed and all letters inside evaporate.\n The 'close to the shelter' means on the ground between the shelter and\n the next shelter (or beginning/end of battlefield). The below samples\n make it clear for you.\n :return:\n ","descriptionHtml":"Test a function that accepts battlefield string and returns letters that survived the nuclear strike.
","status":"passed","steps":[{"name":"Enter test string ([a]#[b]#[c]) and verify the output (ac) vs expected (ac)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a]#b#[c][d]) and verify the output (d) vs expected (d)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([a][b][c]) and verify the output (abc) vs expected (abc)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##a[a]b[c]#) and verify the output (c) vs expected (c)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abde[fgh]ijk) and verify the output (abdefghijk) vs expected (abdefghijk)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ijk) and verify the output (fgh) vs expected (fgh)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (ab#de[fgh]ij#k) and verify the output () vs expected ()","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk) and verify the output () vs expected ()","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]) and verify the output () vs expected ()","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abcde[fgh]) and verify the output () vs expected ()","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (abcde[fgh]) and verify the output (abcdefgh) vs expected (abcdefgh)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (##abde[fgh]ijk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string (#abde[fgh]i#jk[mn]op) and verify the output (mn) vs expected (mn)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test string ([ab]adfd[dd]##[abe]dedf[ijk]d#d[h]#) and verify the output (abijk) vs expected (abijk)","time":{"start":1732764218819,"stop":1732764218819,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":14,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_AlphabetWarTestCase::0","time":{"start":1732764218822,"stop":1732764218822,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"DECLARATIVE"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"PROGRAMMING"},{"name":"tag","value":"LANGUAGE"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Advanced Language Features"},{"name":"tag","value":"FEATURES"},{"name":"tag","value":"REGULAR"},{"name":"tag","value":"EXPRESSIONS"},{"name":"tag","value":"ADVANCED"},{"name":"story","value":"Alphabet wars - nuclear strike"},{"name":"feature","value":"String"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.alphabet_wars_nuclear_strike.test_alphabet_war"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/alphabet-wars-nuclear-strike","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e776a97a9aadedfc","status":"passed","time":{"start":1732428194163,"stop":1732428194163,"duration":0}},{"uid":"a456e8af4c590649","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}},{"uid":"47f8dbee3cb403d3","status":"passed","time":{"start":1724733472546,"stop":1724733472546,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"5d8c14adba840438","status":"passed","time":{"start":1732428194163,"stop":1732428194163,"duration":0}},{"uid":"ace382695affabdf","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}},{"uid":"aca9d99cb0e5842e","status":"passed","time":{"start":1724735127438,"stop":1724735127453,"duration":15}}]},"tags":["STRINGS","LANGUAGE","DECLARATIVE","REGULAR","EXPRESSIONS","FUNDAMENTALS","PROGRAMMING","FEATURES","ADVANCED"]},"source":"e91954f86960f5cf.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/af4da168bd187f62.json b/allure-report/data/test-cases/e9cabde1f2c64760.json similarity index 93% rename from allure-report/data/test-cases/af4da168bd187f62.json rename to allure-report/data/test-cases/e9cabde1f2c64760.json index a3da970639a..69ec0420f14 100644 --- a/allure-report/data/test-cases/af4da168bd187f62.json +++ b/allure-report/data/test-cases/e9cabde1f2c64760.json @@ -1 +1 @@ -{"uid":"af4da168bd187f62","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"af4da168bd187f62.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"e9cabde1f2c64760","name":"test_starting_position_from_positives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_positives","historyId":"8a1027b0cee356a496b84c6b832d107b","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on positive grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on positive grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"e9cabde1f2c64760.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/8dea57e5544d4774.json b/allure-report/data/test-cases/e9f92529af3ab5ff.json
similarity index 71%
rename from allure-report/data/test-cases/8dea57e5544d4774.json
rename to allure-report/data/test-cases/e9f92529af3ab5ff.json
index 532c94c06d3..79ef023f473 100644
--- a/allure-report/data/test-cases/8dea57e5544d4774.json
+++ b/allure-report/data/test-cases/e9f92529af3ab5ff.json
@@ -1 +1 @@
-{"uid":"8dea57e5544d4774","name":"OR logical operator","fullName":"kyu_8.logical_calculator.test_logical_calculator.LogicalCalculatorTestCase#test_logical_calc_or","historyId":"ae9d861fd855b26fd2ffe303ebf8c238","time":{"start":1724733474819,"stop":1724733474819,"duration":0},"description":"\n In logic and mathematics, or is the\n truth-functional operator of (inclusive)\n disjunction, also known as alternation.\n\n The or of a set of operands is true if\n and only if one or more of its operands is true.\n\n Source:\n https://en.wikipedia.org/wiki/Logical_disjunction\n\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1732764219326,"stop":1732764219326,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: insert\n :return:\n ","descriptionHtml":"Testing insert method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1732764219344,"stop":1732764219344,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Insert items to the list","time":{"start":1732764219344,"stop":1732764219344,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219344,"stop":1732764219344,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1732764219344,"stop":1732764219344,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1732764219359,"stop":1732764219359,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"feature","value":"Classes"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"CLASSES"},{"name":"story","value":"DefaultList"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"3f678007c09ea2b5","status":"passed","time":{"start":1732428194667,"stop":1732428194668,"duration":1}},{"uid":"88ed1c9da2d9b53b","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"e8a3e54ef5fe796f","status":"passed","time":{"start":1724733473171,"stop":1724733473171,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"1532fae746d0bb3a","status":"passed","time":{"start":1732428194667,"stop":1732428194668,"duration":1}},{"uid":"2c78d4954ac14f9e","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}},{"uid":"93b3042e12ae0dc2","status":"passed","time":{"start":1724735128063,"stop":1724735128063,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","BASIC LANGUAGE FEATURES","CLASSES"]},"source":"ea77ab4395e92566.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/3e8741eae0b44214.json b/allure-report/data/test-cases/eac7f340d73193c2.json similarity index 62% rename from allure-report/data/test-cases/3e8741eae0b44214.json rename to allure-report/data/test-cases/eac7f340d73193c2.json index 3f3ff6aa7ea..975423f446f 100644 --- a/allure-report/data/test-cases/3e8741eae0b44214.json +++ b/allure-report/data/test-cases/eac7f340d73193c2.json @@ -1 +1 @@ -{"uid":"3e8741eae0b44214","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1732428193985,"stop":1732428193985,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"827104e07f2ca2d0","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}},{"uid":"614d8ec123787b56","status":"passed","time":{"start":1724733472374,"stop":1724733472374,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"7b2352a8e3675c67","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}},{"uid":"db7b4c897ddcf1a6","status":"passed","time":{"start":1724735127235,"stop":1724735127235,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"3e8741eae0b44214.json","parameterValues":[]} \ No newline at end of file +{"uid":"eac7f340d73193c2","name":"Testing next_bigger function","fullName":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger.NextBiggerTestCase#test_next_bigger","historyId":"efddacca930076c1013b396c6bf9ad2b","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_bigger function\n\n You have to test a function that takes a positive integer\n number and returns the next bigger number formed by the same digits:\n\n 12 ==> 21\n 513 ==> 531\n 2017 ==> 2071\n\n If no bigger number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next bigger number formed by the same digits:
12 ==> 21
513 ==> 531
2017 ==> 2071
If no bigger number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (6), generate the result (-1) and compare it with expected (-1)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (12), generate the result (21) and compare it with expected (21)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (513), generate the result (531) and compare it with expected (531)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2017), generate the result (2071) and compare it with expected (2071)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), generate the result (441) and compare it with expected (441)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (144), generate the result (414) and compare it with expected (414)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (6938652), generate the result (6952368) and compare it with expected (6952368)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), generate the result (123456798) and compare it with expected (123456798)","time":{"start":1732428193982,"stop":1732428193982,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextBiggerTestCase::0","time":{"start":1732428193985,"stop":1732428193985,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"story","value":"Next bigger number with the same digits"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"INTEGERS"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_bigger_number_with_the_same_digits.test_next_bigger"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/55983863da40caa2c900004e","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"eac7f340d73193c2.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/1a8ee4991fa5fcbc.json b/allure-report/data/test-cases/eb1b904b9e574ded.json similarity index 79% rename from allure-report/data/test-cases/1a8ee4991fa5fcbc.json rename to allure-report/data/test-cases/eb1b904b9e574ded.json index 2c190a62fcf..d067dcc5077 100644 --- a/allure-report/data/test-cases/1a8ee4991fa5fcbc.json +++ b/allure-report/data/test-cases/eb1b904b9e574ded.json @@ -1 +1 @@ -{"uid":"1a8ee4991fa5fcbc","name":"Testing check_root function","fullName":"kyu_7.always_perfect.test_check_root.CheckRootTestCase#test_check_root","historyId":"9c2d30046a2fe35ee19c9d3833ea20a5","time":{"start":1724735129008,"stop":1724735129008,"duration":0},"description":"\n Testing check_root function with various test inputs\n\n A function which takes numbers separated by commas\n in string format and returns the number which is a\n perfect square and the square root of that number.\n\n If string contains other characters than number or\n it has more or less than 4 numbers separated by comma\n function returns \"incorrect input\".\n\n If string contains 4 numbers but not consecutive it\n returns \"not consecutive\".\n :return:\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1732428194034,"stop":1732428194034,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Strip Comments"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"863d9e582b6f3de4","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}},{"uid":"102a91ff9d2e2c1f","status":"passed","time":{"start":1724733472421,"stop":1724733472437,"duration":16}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"f711bbcd16ab2119","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}},{"uid":"5c64823a2a73f974","status":"passed","time":{"start":1724735127282,"stop":1724735127297,"duration":15}}]},"tags":["STRINGS","ALGORITHMS"]},"source":"4b8219eb37520d2d.json","parameterValues":[]} \ No newline at end of file +{"uid":"ec528f5ba60e276b","name":"Testing 'solution' function","fullName":"kyu_4.strip_comments.test_solution.SolutionTestCase#test_solution","historyId":"c421bbdf427fc6e784d70fcb75e166ee","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'solution' function\n\n The solution should strips all text that follows any\n of a set of comment markers passed in. Any whitespace at\n the end of the line should also be stripped out.\n ","descriptionHtml":"Testing permutations function
The solution should strips all text that follows any of a set of comment markers passed in. Any whitespace at the end of the line should also be stripped out.
","status":"passed","steps":[{"name":"Enter a test string (apples, pears # and bananas\ngrapes\nbananas !apples) and verify the output (apples, pears\ngrapes\nbananas) vs expected (apples, pears\ngrapes\nbananas)","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string (a #b\nc\nd $e f g) and verify the output (a\nc\nd) vs expected (a\nc\nd)","time":{"start":1732428194032,"stop":1732428194032,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SolutionTestCase::0","time":{"start":1732428194034,"stop":1732428194034,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Strip Comments"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"Algorithms"},{"name":"parentSuite","value":"Competent"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.strip_comments.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/51c8e37cee245da6b40000bd","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS"]},"source":"ec528f5ba60e276b.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/898b5d5677e24adf.json b/allure-report/data/test-cases/ed0b0c9c45304a0b.json similarity index 68% rename from allure-report/data/test-cases/898b5d5677e24adf.json rename to allure-report/data/test-cases/ed0b0c9c45304a0b.json index 9acbe9106b2..b76b03be4d7 100644 --- a/allure-report/data/test-cases/898b5d5677e24adf.json +++ b/allure-report/data/test-cases/ed0b0c9c45304a0b.json @@ -1 +1 @@ -{"uid":"898b5d5677e24adf","name":"Testing 'order' function","fullName":"kyu_6.your_order_please.test_order.OrderTestCase#test_order","historyId":"337f8da3fccb836acfa7a9f697d95259","time":{"start":1732428195716,"stop":1732428195716,"duration":0},"description":"\n Your task is to verify that 'order' function\n sorts a given string by following rules:\n\n 1. Each word in the string will contain a single number.\n This number is the position the word should have in\n the result.\n\n 2. Note: Numbers can be from 1 to 9. So 1 will be the\n first word (not 0).\n\n 3. If the input string is empty, return an empty string.\n The words in the input String will only contain valid\n consecutive numbers.\n\n :return:\n ","descriptionHtml":"Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Your task is to verify that 'order' function sorts a given string by following rules:1. Each word in the string will contain a single number. This number is the position the word should have in the result.
2. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
3. If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"16b3d133c1b1141f","name":"stdout","source":"16b3d133c1b1141f.txt","type":"text/plain","size":222}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"280a7287fd39d5a9","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}},{"uid":"f80f9bf6821c7c25","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"9fa9266ff3a1c464.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"ed9cfa6ba87dba0e","name":"test_basic","fullName":"kyu_7.coloured_triangles.test_triangle.TriangleTestCase#test_basic","historyId":"81b718c3bba361637ce9ed2266cd30d2","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"description":"\n Basic test case\n :return:\n ","descriptionHtml":" Basic test case\n :return:\n
\n","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Basic test case\n :return:\n ","status":"passed","steps":[{"name":"Enter test string and verify the output","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"41df37e97a182fa4","name":"stdout","source":"41df37e97a182fa4.txt","type":"text/plain","size":222}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TriangleTestCase::0","time":{"start":1724733474194,"stop":1724733474194,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"Algorithms"},{"name":"tag","value":"Strings"},{"name":"tag","value":"Logic"},{"name":"story","value":"Coloured Triangles"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.coloured_triangles.test_triangle"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"9fa9266ff3a1c464","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}},{"uid":"280a7287fd39d5a9","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}},{"uid":"f80f9bf6821c7c25","status":"passed","time":{"start":1724733474194,"stop":1724733474194,"duration":0}}]},"tags":["Algorithms","Logic","Strings"]},"source":"ed9cfa6ba87dba0e.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/27f5e11d20d2d96c.json b/allure-report/data/test-cases/edb0e461adb94f5b.json
similarity index 61%
rename from allure-report/data/test-cases/27f5e11d20d2d96c.json
rename to allure-report/data/test-cases/edb0e461adb94f5b.json
index 594aa848a1e..5341522ca8e 100644
--- a/allure-report/data/test-cases/27f5e11d20d2d96c.json
+++ b/allure-report/data/test-cases/edb0e461adb94f5b.json
@@ -1 +1 @@
-{"uid":"27f5e11d20d2d96c","name":"Testing first_non_repeated function with various inputs","fullName":"kyu_7.the_first_non_repeated_character_in_string.test_first_non_repeated.FirstNonRepeatedTestCase#test_first_non_repeated","historyId":"9398abf0c9f75b70331fc87dcc2b8a7f","time":{"start":1732428196044,"stop":1732428196044,"duration":0},"description":"\n Testing first_non_repeated function\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1732764220283,"stop":1732764220283,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test that a function that given a sequence of strings,\n groups the elements that can be obtained by rotating others,\n ignoring upper or lower cases.\n\n In the event that an element appears more than once in\n the input sequence, only one of them will be taken into\n account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220285,"stop":1732764220285,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220285,"stop":1732764220285,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220285,"stop":1732764220285,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220285,"stop":1732764220285,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220285,"stop":1732764220285,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220286,"stop":1732764220286,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220286,"stop":1732764220286,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732764220286,"stop":1732764220286,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1732764220288,"stop":1732764220288,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"PUZZLES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"4a6083b6c2f5cc4b","status":"passed","time":{"start":1732428195606,"stop":1732428195607,"duration":1}},{"uid":"14c8b0cd48caa4d6","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}},{"uid":"f293d4274aefdd43","status":"passed","time":{"start":1724733474054,"stop":1724733474054,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"25fd6f6c5cfe2b58","status":"passed","time":{"start":1732428195606,"stop":1732428195607,"duration":1}},{"uid":"8655885cb5db7a58","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}},{"uid":"578c3a6cd3e7e40f","status":"passed","time":{"start":1724735128899,"stop":1724735128899,"duration":0}}]},"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"ee07ce647fa212f.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/af82a0c3b0cef265.json b/allure-report/data/test-cases/ee16b6e353dfd7cd.json similarity index 59% rename from allure-report/data/test-cases/af82a0c3b0cef265.json rename to allure-report/data/test-cases/ee16b6e353dfd7cd.json index 98a27ef3993..3d96792d1e0 100644 --- a/allure-report/data/test-cases/af82a0c3b0cef265.json +++ b/allure-report/data/test-cases/ee16b6e353dfd7cd.json @@ -1 +1 @@ -{"uid":"af82a0c3b0cef265","name":"Testing the 'solution' function","fullName":"kyu_6.multiples_of_3_or_5.test_solution.SolutionTestCase#test_solution","historyId":"c387db789a67b80c29f3c3ba2e6c9bce","time":{"start":1732428195530,"stop":1732428195531,"duration":1},"description":"\n Testing solution function\n\n If we list all the natural numbers below 10\n that are multiples of 3 or 5, we get 3, 5, 6 and 9.\n The sum of these multiples is 23.\n\n Finish the solution so that it returns the sum of\n all the multiples of 3 or 5 below the number passed in.\n\n Note: If the number is a multiple of both 3 and 5,\n only count it once.\n :return:\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"1e1a39cd8bddfb25","name":"stdout","source":"1e1a39cd8bddfb25.txt","type":"text/plain","size":565}],"parameters":[],"hasContent":true,"stepsCount":10,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"f9c645ee48c4616c.json","parameterValues":[]} \ No newline at end of file +{"uid":"ee182a5a1f4b39dc","name":"Testing next_smaller function","fullName":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller.NextSmallerTestCase#test_next_smaller","historyId":"9d8cb8adf1764c55348d349698b938ac","time":{"start":1724735127235,"stop":1724735127250,"duration":15},"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing next_smaller function\n\n You have to test a function that takes a positive integer number\n and returns the next smaller number formed by the same digits:\n\n 21 ==> 12\n 531 ==> 513\n 2071 ==> 2017\n\n If no smaller number can be composed using those digits, return -1\n ","descriptionHtml":"Testing next_bigger function
You have to test a function that takes a positive integer number and returns the next smaller number formed by the same digits:
21 ==> 12
531 ==> 513
2071 ==> 2017
If no smaller number can be composed using those digits, return -1
","status":"passed","steps":[{"name":"Enter an integer (1027), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1262347), calculate the result (1247632) and compare it with expected (1247632)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (907), calculate the result (790) and compare it with expected (790)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (531), calculate the result (513) and compare it with expected (513)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (135), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (2071), calculate the result (2017) and compare it with expected (2017)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (414), calculate the result (144) and compare it with expected (144)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456798), calculate the result (123456789) and compare it with expected (123456789)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (123456789), calculate the result (-1) and compare it with expected (-1)","time":{"start":1724735127235,"stop":1724735127235,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter an integer (1234567908), calculate the result (1234567890) and compare it with expected (1234567890)","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"7cf8e66e6e1debdd","name":"stdout","source":"7cf8e66e6e1debdd.txt","type":"text/plain","size":565}],"parameters":[],"stepsCount":10,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_NextSmallerTestCase::0","time":{"start":1724735127250,"stop":1724735127250,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"4 kyu"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"NUMBERS"},{"name":"feature","value":"String"},{"name":"tag","value":"INTEGERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Next smaller number with the same digits"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.next_smaller_number_with_the_same_digits.test_next_smaller"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5659c6d896bc135c4c00021e/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","STRINGS","NUMBERS","INTEGERS","ALGORITHMS"]},"source":"ee182a5a1f4b39dc.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/30b1174850b5a822.json b/allure-report/data/test-cases/ee3233c4ab89c7ec.json similarity index 93% rename from allure-report/data/test-cases/30b1174850b5a822.json rename to allure-report/data/test-cases/ee3233c4ab89c7ec.json index 79e8f8a4d6b..47f0dabcb48 100644 --- a/allure-report/data/test-cases/30b1174850b5a822.json +++ b/allure-report/data/test-cases/ee3233c4ab89c7ec.json @@ -1 +1 @@ -{"uid":"30b1174850b5a822","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"30b1174850b5a822.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"ee3233c4ab89c7ec","name":"test_starting_position_from_negatives","fullName":"kyu_3.line_safari_is_that_a_line.test_walker.WalkerClassTestCase#test_starting_position_from_negatives","historyId":"d078abbf63387d06892c04835cc6719c","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"description":"\n Testing Walker class\n Testing starting position property based on negative grids\n ","descriptionHtml":" Testing Walker class\n Testing starting position property based on negative grids\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_walker.py', 89, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_walker"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ee3233c4ab89c7ec.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/ee3eb820ef7c27.json b/allure-report/data/test-cases/ee3eb820ef7c27.json
deleted file mode 100644
index 82dac762440..00000000000
--- a/allure-report/data/test-cases/ee3eb820ef7c27.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"ee3eb820ef7c27","name":"Negative non consecutive number should be returned","fullName":"kyu_8.find_the_first_non_consecutive_number.test_first_non_consecutive.FirstNonConsecutiveTestCase#test_first_non_consecutive_negative","historyId":"f9c1f10fe995fd827dbc67efd6c689cb","time":{"start":1724733474647,"stop":1724733474647,"duration":0},"description":"\n non-consecutive is a negative number.\n :return:\n ","descriptionHtml":" Testing using basic test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"deff2de3f9ed88f5","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"e47ebce66bbb53cd","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724733472577,"stop":1724733472577,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":3,"passed":0,"unknown":0,"total":3},"items":[{"uid":"d6d51bdb700f78e3","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}},{"uid":"ad08cb0fb6eef203","status":"skipped","statusDetails":"Skipped: The solution is not ready","time":{"start":1724735127469,"stop":1724735127469,"duration":0}}]},"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"a57a3497f4402b67.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"ee7ac80cd7bb8f8d","name":"test_solution_basic","fullName":"kyu_5.diophantine_equation.test_solution.SolutionTestCase#test_solution_basic","historyId":"ea802d18b118f621c35bcaf8644d85ff","time":{"start":1732428194185,"stop":1732428194185,"duration":0},"description":"\n Testing using basic test data\n :return:\n ","descriptionHtml":" Testing using basic test data\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\diophantine_equation\\\\test_solution.py', 34, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Math"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"NUMBERS"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Diophantine Equation"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.diophantine_equation.test_solution"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/554f76dca89983cc400000bb","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ee7ac80cd7bb8f8d.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/eea4c328ad2eaeca.json b/allure-report/data/test-cases/eea4c328ad2eaeca.json
deleted file mode 100644
index c8b592cabe4..00000000000
--- a/allure-report/data/test-cases/eea4c328ad2eaeca.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"eea4c328ad2eaeca","name":"Testing toJadenCase function (positive)","fullName":"kyu_7.jaden_casing_strings.test_jaden_casing_strings.JadenCasingStringsTestCase#test_to_jaden_case_positive","historyId":"7c48f5c6aa887d1bc76d081b028cf7cf","time":{"start":1724733474319,"stop":1724733474319,"duration":0},"description":"\n Simple positive test\n :return:\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase","time":{"start":1732764219184,"stop":1732764219184,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'sum_pairs' function\n\n Given a list of integers and a single sum value,\n the function should return the first two values\n (parse from the left please) in order of appearance\n that add up to form the sum.\n ","descriptionHtml":"Given a list of integers and a single sum value, the function should return the first two values (parse from the left please) in order of appearance that add up to form the sum.
","status":"passed","steps":[{"name":"Enter a test list and verify the output.","time":{"start":1732764219186,"stop":1732764219186,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SumPairsTestCase::0","time":{"start":1732764219187,"stop":1732764219187,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Sum of Pairs"},{"name":"tag","value":"DESIGN PATTERNS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"DESIGN PRINCIPLES"},{"name":"feature","value":"Memoization"},{"name":"tag","value":"MEMOIZATION"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PARSING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.sum_of_pairs.test_sum_pairs"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54d81488b981293527000c8f","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"e248ed6a4ff28aaa","status":"passed","time":{"start":1732428194512,"stop":1732428194512,"duration":0}},{"uid":"1065b8b44c0afc6f","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}},{"uid":"2c53cc9448de91f2","status":"passed","time":{"start":1724733472999,"stop":1724733472999,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"607f84fe70696eb5","status":"passed","time":{"start":1732428194512,"stop":1732428194512,"duration":0}},{"uid":"2965d2d3db0ea08e","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}},{"uid":"be5a8376fdcba717","status":"passed","time":{"start":1724735127906,"stop":1724735127906,"duration":0}}]},"tags":["STRINGS","DESIGN PRINCIPLES","FUNDAMENTALS","MEMOIZATION","DESIGN PATTERNS","PARSING ALGORITHMS"]},"source":"ef2b00c02db84592.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/ef2d26c76c436892.json b/allure-report/data/test-cases/ef2ebe964f1d2f5f.json similarity index 94% rename from allure-report/data/test-cases/ef2d26c76c436892.json rename to allure-report/data/test-cases/ef2ebe964f1d2f5f.json index d9ec4c20211..36444553339 100644 --- a/allure-report/data/test-cases/ef2d26c76c436892.json +++ b/allure-report/data/test-cases/ef2ebe964f1d2f5f.json @@ -1 +1 @@ -{"uid":"ef2d26c76c436892","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Permutations"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"PERMUTATIONS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ef2d26c76c436892.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"ef2ebe964f1d2f5f","name":"test_permutations","fullName":"kyu_4.permutations.test_permutations.PermutationsTestCase#test_permutations","historyId":"acc964c78dd821707ef4a0652a683e9a","time":{"start":1724733472390,"stop":1724733472390,"duration":0},"description":"\n Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n ","descriptionHtml":" Testing permutations function\n\n Test that permutations function creates all\n permutations of an input string and\n remove duplicates, if present. This means, you\n have to shuffle all letters from the input in all\n possible orders.\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_4\\\\permutations\\\\test_permutations.py', 31, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"story","value":"Permutations"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"4 kyu"},{"name":"tag","value":"PERMUTATIONS"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.permutations.test_permutations"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5254ca2719453dcc0b00027d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PERMUTATIONS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"ef2ebe964f1d2f5f.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/ef53249dd3798b49.json b/allure-report/data/test-cases/ef53249dd3798b49.json
new file mode 100644
index 00000000000..1464e81df6e
--- /dev/null
+++ b/allure-report/data/test-cases/ef53249dd3798b49.json
@@ -0,0 +1 @@
+{"uid":"ef53249dd3798b49","name":"Wolf in the middle of the queue","fullName":"kyu_8.wolf_in_sheep_clothing.test_wolf_in_sheep_clothing.WarnTheSheepTestCase#test_warn_the_sheep_wolf_in_middle","historyId":"3de540be96edd1a6ef052fccdb3f5cad","time":{"start":1732764221343,"stop":1732764221343,"duration":0},"description":"\n If the wolf is the closest animal to you,\n return \"Pls go away and stop eating my sheep\".\n :return:\n ","descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"7e0608ae57e6ca33","name":"stdout","source":"7e0608ae57e6ca33.txt","type":"text/plain","size":253}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"920950efadf9f044.json","parameterValues":[]} \ No newline at end of file +{"uid":"efdfaccb93c4c6b4","name":"Testing take function","fullName":"kyu_8.enumerable_magic_25.test_take.TakeTestCase#test_take","historyId":"d35757cf261e283f5eab532965102602","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Create a method take that accepts a list/array and a number n, and returns a list/array array of the first n elements from the list/array. If you need help, here's a reference: https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range
","status":"passed","steps":[{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([0, 1, 2]) vs actual result ([0, 1, 2])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([51]) and verify the expected output ([51]) vs actual result ([51])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list ([0, 1, 2, 3, 5, 8, 13]) and verify the expected output ([]) vs actual result ([])","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"42b879e2f735a0ac","name":"stdout","source":"42b879e2f735a0ac.txt","type":"text/plain","size":253}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_TakeTestCase::0","time":{"start":1724733474632,"stop":1724733474632,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Beginner"},{"name":"epic","value":"8 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"Enumerable Magic #25 - Take the First N Elements"},{"name":"subSuite","value":"Unit Tests"},{"name":"suite","value":"Data Structures"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.enumerable_magic_25.test_take"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/545afd0761aa4c3055001386/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"efdfaccb93c4c6b4.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/191f183f3ba0c8ea.json b/allure-report/data/test-cases/f0cf41ee7ec62257.json similarity index 59% rename from allure-report/data/test-cases/191f183f3ba0c8ea.json rename to allure-report/data/test-cases/f0cf41ee7ec62257.json index 01a37f7f951..4ffd043b762 100644 --- a/allure-report/data/test-cases/191f183f3ba0c8ea.json +++ b/allure-report/data/test-cases/f0cf41ee7ec62257.json @@ -1 +1 @@ -{"uid":"191f183f3ba0c8ea","name":"Testing the 'unique_in_order' function","fullName":"kyu_6.unique_in_order.test_unique_in_order.UniqueInOrderTestCase#test_unique_in_order","historyId":"9cff2d5d4d73fbc92b1c7c29d738384f","time":{"start":1732428195692,"stop":1732428195692,"duration":0},"description":"\n Testing the 'unique_in_order' function\n with various test data\n :return:\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"445f2e59cb6a4191.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"f10852a0a46489bf","name":"test_line_negative","fullName":"kyu_3.line_safari_is_that_a_line.test_line_negative.LineNegativeTestCase#test_line_negative","historyId":"e5c7abe0fcf3b79049d906f50808feb6","time":{"start":1724735127172,"stop":1724735127172,"duration":0},"description":"\n Testing Line Safari functionality\n Negative test cases\n ","descriptionHtml":" Testing Line Safari functionality\n Negative test cases\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_3\\\\line_safari_is_that_a_line\\\\test_line_negative.py', 36, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"epic","value":"3 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Competent"},{"name":"feature","value":"String"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Line Safari - Is that a line?"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.line_safari_is_that_a_line.test_line_negative"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/59c5d0b0a25c8c99ca000237/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"f10852a0a46489bf.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/5b153d545c48d264.json b/allure-report/data/test-cases/f17cc6d65b0932fd.json
similarity index 72%
rename from allure-report/data/test-cases/5b153d545c48d264.json
rename to allure-report/data/test-cases/f17cc6d65b0932fd.json
index dd2cccae088..671289064f3 100644
--- a/allure-report/data/test-cases/5b153d545c48d264.json
+++ b/allure-report/data/test-cases/f17cc6d65b0932fd.json
@@ -1 +1 @@
-{"uid":"5b153d545c48d264","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"5ab43402bfd67bde","name":"stdout","source":"5ab43402bfd67bde.txt","type":"text/plain","size":326}],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"5b153d545c48d264.json","parameterValues":[]} \ No newline at end of file +{"uid":"f17cc6d65b0932fd","name":"Testing create_city_map function","fullName":"kyu_5.find_the_safest_places_in_town.test_advice.FirstAdviceTestCase#test_create_city_map","historyId":"e437e22193ec7315819824ea1255ab3f","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing a function named create_city_map where:\n - n defines the size of the city that Bassi needs to hide in,\n in other words the side length of the square grid.\n\n The function should generate city map with coordinates.\n :return:\n ","descriptionHtml":"The function should generate city map with coordinates.
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1724735127516,"stop":1724735127516,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"ef5ba384071190d7","name":"stdout","source":"ef5ba384071190d7.txt","type":"text/plain","size":326}],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FirstAdviceTestCase::0","time":{"start":1724735127656,"stop":1724735127656,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Find the safest places in town"},{"name":"feature","value":"Lists"},{"name":"parentSuite","value":"Novice"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.find_the_safest_places_in_town.test_advice"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5dd82b7cd3d6c100109cb4ed/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["ALGORITHMS"]},"source":"f17cc6d65b0932fd.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8cf44bb18023836b.json b/allure-report/data/test-cases/f1908dde48e8dbb5.json similarity index 75% rename from allure-report/data/test-cases/8cf44bb18023836b.json rename to allure-report/data/test-cases/f1908dde48e8dbb5.json index 54603c805f4..a422fb3a797 100644 --- a/allure-report/data/test-cases/8cf44bb18023836b.json +++ b/allure-report/data/test-cases/f1908dde48e8dbb5.json @@ -1 +1 @@ -{"uid":"8cf44bb18023836b","name":"Testing digital_root function","fullName":"kyu_6.sum_of_digits_digital_root.test_digital_root.DigitalRootTestCase#test_digital_root","historyId":"3d4d9d606fbf24bad8abb0f0f85e6130","time":{"start":1724735128961,"stop":1724735128961,"duration":0},"description":"\n In this kata, you must create a digital root function.\n\n A digital root is the recursive sum of all the digits\n in a number. Given n, take the sum of the digits of n.\n If that value has more than one digit, continue reducing\n in this way until a single-digit number is produced. This\n is only applicable to the natural numbers.\n :return:\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"a31af19dcd964af7","name":"stdout","source":"a31af19dcd964af7.txt","type":"text/plain","size":1865}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Lists"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"815ff7102e2d18bc.json","parameterValues":[]} \ No newline at end of file +{"uid":"f207a08521ff3dd3","name":"Testing spiralize function","fullName":"kyu_3.make_spiral.test_spiralize.SpiralizeTestCase#test_spiralize","historyId":"3249b5db727c0aadecf3cb62b280e675","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase","time":{"start":1724733472327,"stop":1724733472327,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing spiralize function\n ","descriptionHtml":"The function should create a NxN spiral with a given size.
","status":"passed","steps":[{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter spiral list size and verify the result","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"1de780c85f2aabb6","name":"stdout","source":"1de780c85f2aabb6.txt","type":"text/plain","size":1865}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SpiralizeTestCase::0","time":{"start":1724733472343,"stop":1724733472343,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Lists"},{"name":"tag","value":"CONTROL FLOW"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Make a spiral"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"3 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_3.make_spiral.test_spiralize"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/534e01fbbb17187c7e0000c6/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","CONTROL FLOW","BASIC LANGUAGE FEATURES","ALGORITHMS","ARRAYS"]},"source":"f207a08521ff3dd3.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/342dee44f5f15fde.json b/allure-report/data/test-cases/f20c6ac583494462.json similarity index 65% rename from allure-report/data/test-cases/342dee44f5f15fde.json rename to allure-report/data/test-cases/f20c6ac583494462.json index 32f18939b58..9a93a472d8c 100644 --- a/allure-report/data/test-cases/342dee44f5f15fde.json +++ b/allure-report/data/test-cases/f20c6ac583494462.json @@ -1 +1 @@ -{"uid":"342dee44f5f15fde","name":"move function tests","fullName":"kyu_8.terminal_game_move_function.test_terminal_game_move_function.MoveTestCase#test_move","historyId":"c589035c90d432fb71a99aec4f56ee9e","time":{"start":1724735129680,"stop":1724735129680,"duration":0},"description":"\n The player rolls the dice and moves the number\n of spaces indicated by the dice two times.\n\n Pass position and roll and compare the output\n to the expected result\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Append the list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"c77e43a426f47681","name":"stdout","source":"c77e43a426f47681.txt","type":"text/plain","size":261}],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"9c43e0c7813423da.json","parameterValues":[]} \ No newline at end of file +{"uid":"f25197354d7a779d","name":"Testing 'DefaultList' class: append","fullName":"kyu_6.default_list.test_default_list.DefaultListTestCase#test_default_list_append","historyId":"84d7f0a1c2a345b29fa2e222a5ed7ee5","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'DefaultList' class: append\n :return:\n ","descriptionHtml":"Testing append method.
","status":"passed","steps":[{"name":"Create a list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Append the list","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128031,"stop":1724735128047,"duration":16},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Get list item by index and verify the results","time":{"start":1724735128047,"stop":1724735128047,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"abb95e0c50272d33","name":"stdout","source":"abb95e0c50272d33.txt","type":"text/plain","size":261}],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DefaultListTestCase::0","time":{"start":1724735128078,"stop":1724735128078,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"story","value":"DefaultList"},{"name":"feature","value":"Classes"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"tag","value":"CLASSES"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"suite","value":"Object-Oriented Programming"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.default_list.test_default_list"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e882048999e6c0023412908/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES"]},"source":"f25197354d7a779d.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/e7e28dd8f45c4374.json b/allure-report/data/test-cases/f253bf40e74f545d.json similarity index 74% rename from allure-report/data/test-cases/e7e28dd8f45c4374.json rename to allure-report/data/test-cases/f253bf40e74f545d.json index af609daa6da..f397242dc2b 100644 --- a/allure-report/data/test-cases/e7e28dd8f45c4374.json +++ b/allure-report/data/test-cases/f253bf40e74f545d.json @@ -1 +1 @@ -{"uid":"e7e28dd8f45c4374","name":"Testing all_fibonacci_numbers function","fullName":"kyu_5.fibonacci_streaming.test_all_fibonacci_numbers.AllFibonacciNumbersTestCase#test_all_fibonacci_numbers","historyId":"a7b5f0a3a7cd2fe8faed75e5c4a52138","time":{"start":1724733472608,"stop":1724733472608,"duration":0},"description":"\n Testing all_fibonacci_numbers function\n\n You're going to provide a needy programmer a\n utility method that generates an infinite sized,\n sequential IntStream (in Python generator)\n which contains all the numbers in a fibonacci\n sequence.\n\n A fibonacci sequence starts with two 1s.\n Every element afterwards is the sum of\n the two previous elements.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"2e5a8277ac6080e3","name":"stdout","source":"2e5a8277ac6080e3.txt","type":"text/plain","size":1536}],"parameters":[],"hasContent":true,"stepsCount":8,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Lists"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"LISTS"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"924a52587e7b2c82.json","parameterValues":[]} \ No newline at end of file +{"uid":"f293d4274aefdd43","name":"Testing the 'group_cities' function","fullName":"kyu_6.rotate_the_letters_of_each_element.test_group_cities.GroupCitiesTestCase#test_group_cities","historyId":"0b146f7fbac52b042804286da8716f6b","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test that a function that given a sequence of strings, groups the elements\n that can be obtained by rotating others, ignoring upper or lower cases.\n\n In the event that an element appears more than once in the input sequence,\n only one of them will be taken into account for the result, discarding the rest.\n :return:\n ","descriptionHtml":"Test that a function that given a sequence of strings, groups the elements that can be obtained by rotating others, ignoring upper or lower cases. In the event that an element appears more than once in the input sequence, only one of them will be taken into account for the result, discarding the rest.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"60a8c5c2c7c00ce5","name":"stdout","source":"60a8c5c2c7c00ce5.txt","type":"text/plain","size":1536}],"parameters":[],"stepsCount":8,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GroupCitiesTestCase::0","time":{"start":1724733474054,"stop":1724733474054,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"PUZZLES"},{"name":"feature","value":"Lists"},{"name":"tag","value":"STRINGS"},{"name":"tag","value":"LISTS"},{"name":"story","value":"ROTATE THE LETTERS OF EACH ELEMENT"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"SORTING ALGORITHMS"},{"name":"suite","value":"Algorithms"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.rotate_the_letters_of_each_element.test_group_cities"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e98712b7de14f0026ef1cc1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","LISTS","SORTING ALGORITHMS","PUZZLES","DATA STRUCTURES"]},"source":"f293d4274aefdd43.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/7c9ea3ba0070bf05.json b/allure-report/data/test-cases/f2a7bab28da55269.json similarity index 69% rename from allure-report/data/test-cases/7c9ea3ba0070bf05.json rename to allure-report/data/test-cases/f2a7bab28da55269.json index 96983b19d50..8e28c9945af 100644 --- a/allure-report/data/test-cases/7c9ea3ba0070bf05.json +++ b/allure-report/data/test-cases/f2a7bab28da55269.json @@ -1 +1 @@ -{"uid":"7c9ea3ba0070bf05","name":"All chars are in lower case","fullName":"kyu_6.character_frequency.test_character_frequency.LetterFrequencyTestCase#test_letter_frequency_all_lower","historyId":"124f2add699f3e2269c311afae219c6e","time":{"start":1724733473108,"stop":1724733473108,"duration":0},"description":"\n Testing letter_frequency function\n where all chars are in lower case\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1732428196495,"stop":1732428196495,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1732428196503,"stop":1732428196503,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1732428196505,"stop":1732428196505,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"99ca7a938f9d4989","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}},{"uid":"2980fd5af6447b30","status":"passed","time":{"start":1724733475038,"stop":1724733475038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"35cf25b9e515e00d","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}},{"uid":"928532982127bba0","status":"passed","time":{"start":1724735129789,"stop":1724735129789,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"4c77d97bc41048ff.json","parameterValues":[]} \ No newline at end of file +{"uid":"f3b1ea272cafb8c8","name":"Positive test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_positive","historyId":"c191b2a68976eb18aef4345f496d79e7","time":{"start":1732428196503,"stop":1732428196503,"duration":0},"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1732428196495,"stop":1732428196495,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Positive test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Positive test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Compare expected list with the list of actual results","time":{"start":1732428196503,"stop":1732428196503,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1732428196505,"stop":1732428196505,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"f3b1ea272cafb8c8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f3baf14f5477154.json b/allure-report/data/test-cases/f3baf14f5477154.json deleted file mode 100644 index de01ac5f849..00000000000 --- a/allure-report/data/test-cases/f3baf14f5477154.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"f3baf14f5477154","name":"Testing zeros function","fullName":"kyu_5.number_of_trailing_zeros_of_n.test_zeros.ZerosTestCase#test_zeros","historyId":"bf37412e0e610d07d951e5fde674ec97","time":{"start":1724735127860,"stop":1724735127860,"duration":0},"description":"\n Testing 'zeros' program that should calculate the number\n of trailing zeros in a factorial of a given number.\n :return: None\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1732428194139,"stop":1732428194139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert level","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert experience","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Assert rank","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":4,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1732428194147,"stop":1732428194147,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"9c2fc5bac7417dd0","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}},{"uid":"3d13030ecd2583e8","status":"passed","time":{"start":1724733472530,"stop":1724733472530,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"675849fee1009391","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}},{"uid":"c1f2317d20109e13","status":"passed","time":{"start":1724735127422,"stop":1724735127422,"duration":0}}]},"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"1700dd3f253e8636.json","parameterValues":[]} \ No newline at end of file +{"uid":"f520dc2a3cdded7a","name":"Testing Warrior class >>> tom","fullName":"kyu_4.the_greatest_warrior.test_warrior.WarriorTestCase#test_warrior_tom","historyId":"e1d51bbc08408469e032e2f57944bc05","time":{"start":1732428194145,"stop":1732428194146,"duration":1},"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase","time":{"start":1732428194139,"stop":1732428194139,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing Warrior class >>> tom\n ","descriptionHtml":"Basic test: level, experience, rank
","status":"passed","steps":[{"name":"Instantiate a new warrior >>> tom","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert level","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert experience","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Assert rank","time":{"start":1732428194146,"stop":1732428194146,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":4,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_WarriorTestCase::0","time":{"start":1732428194147,"stop":1732428194147,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"4 kyu"},{"name":"suite","value":"OOP"},{"name":"tag","value":"ALGORITHMS"},{"name":"feature","value":"Classes"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"OBJECT-ORIENTED PROGRAMMING"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"story","value":"The Greatest Warrior"},{"name":"tag","value":"RULES"},{"name":"tag","value":"CLASSES"},{"name":"parentSuite","value":"Competent"},{"name":"tag","value":"BASIC LANGUAGE FEATURES"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_4.the_greatest_warrior.test_warrior"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5941c545f5c394fef900000c","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["OBJECT-ORIENTED PROGRAMMING","FUNDAMENTALS","CLASSES","BASIC LANGUAGE FEATURES","ALGORITHMS","RULES"]},"source":"f520dc2a3cdded7a.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f52e2a19a3ffe707.json b/allure-report/data/test-cases/f52e2a19a3ffe707.json deleted file mode 100644 index a3620f22d10..00000000000 --- a/allure-report/data/test-cases/f52e2a19a3ffe707.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"f52e2a19a3ffe707","name":"Testing permute_a_palindrome (positive)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_positive","historyId":"faf1054cf60e3f1fbb45c8dc0ece579f","time":{"start":1724733474023,"stop":1724733474023,"duration":0},"description":"\n Testing permute_a_palindrome function\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1732428196495,"stop":1732428196495,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1732428196496,"stop":1732428196496,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1732428196505,"stop":1732428196505,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"critical","retries":[{"uid":"8beabd2469a668","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"6373ea673c2617a2","status":"passed","time":{"start":1724733475022,"stop":1724733475022,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"69f65011f131e2b6","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}},{"uid":"5e4b0e05a0862f7e","status":"passed","time":{"start":1724735129774,"stop":1724735129774,"duration":0}}]},"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"dd76819b5fd836d3.json","parameterValues":[]} \ No newline at end of file +{"uid":"f585eec372fcc899","name":"Negative test cases for gen_primes function testing","fullName":"utils.primes.test_primes_generator.GenPrimesTestCase#test_gen_primes_negative","historyId":"4a2df53975623c10d30ec1c6932ba04a","time":{"start":1732428196496,"stop":1732428196496,"duration":0},"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase","time":{"start":1732428196495,"stop":1732428196495,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Negative test cases for gen_primes function testing\n :return:\n ","descriptionHtml":"Negative test cases for gen_primes function testing.
","status":"passed","steps":[{"name":"Answer for all numbers from the test data is: False.","time":{"start":1732428196496,"stop":1732428196496,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_GenPrimesTestCase::0","time":{"start":1732428196505,"stop":1732428196505,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"critical"},{"name":"feature","value":"Utils"},{"name":"tag","value":"UTILS"},{"name":"story","value":"Testing gen_primes util"},{"name":"suite","value":"No kyu helper methods"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"No kyu"},{"name":"parentSuite","value":"Helper methods"},{"name":"tag","value":"PRIMES"},{"name":"tag","value":"PRIME NUMBERS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"utils.primes.test_primes_generator"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source","url":"https://github.com/ikostan/codewars/tree/master/utils","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["UTILS","PRIME NUMBERS","PRIMES"]},"source":"f585eec372fcc899.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f5c9e062133dbbbb.json b/allure-report/data/test-cases/f5c9e062133dbbbb.json new file mode 100644 index 00000000000..57095b98e9e --- /dev/null +++ b/allure-report/data/test-cases/f5c9e062133dbbbb.json @@ -0,0 +1 @@ +{"uid":"f5c9e062133dbbbb","name":"Testing Potion class","fullName":"kyu_6.potion_class_101.test_potion.PotionTestCase#test_potion","historyId":"4d7a6b080aa8dcf06d68a1f957a8e465","time":{"start":1732764220268,"stop":1732764220270,"duration":2},"description":"\n Testing potion function with various test inputs\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":3,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase","time":{"start":1732764220267,"stop":1732764220267,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing potion function with various test inputs\n :return:\n ","descriptionHtml":"Test Potion class that mix between 2 RGB colors.
","status":"passed","steps":[{"name":"Mix between RGB colors and verify the output","time":{"start":1732764220268,"stop":1732764220268,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_PotionTestCase::0","time":{"start":1732764220270,"stop":1732764220270,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"ALGORITHMS"},{"name":"suite","value":"Classes"},{"name":"story","value":"Potion Class 101"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"Algorithms"},{"name":"epic","value":"6 kyu"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"11036-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.potion_class_101.test_potion"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5981ff1daf72e8747d000091","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"77a9a3d99a741f47","status":"passed","time":{"start":1732428195590,"stop":1732428195590,"duration":0}},{"uid":"79e5a850abe86297","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"111dbc365b1f3e78","status":"passed","time":{"start":1724733474038,"stop":1724733474038,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":4,"unknown":0,"total":4},"items":[{"uid":"d820d165ec4b4b72","status":"passed","time":{"start":1732428195590,"stop":1732428195590,"duration":0}},{"uid":"cdfe495bc85470d2","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}},{"uid":"7d1621a20d6f8fe7","status":"passed","time":{"start":1724735128883,"stop":1724735128883,"duration":0}}]},"tags":["ALGORITHMS"]},"source":"f5c9e062133dbbbb.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/f619b88d74382886.json b/allure-report/data/test-cases/f619b88d74382886.json deleted file mode 100644 index 797ca937822..00000000000 --- a/allure-report/data/test-cases/f619b88d74382886.json +++ /dev/null @@ -1 +0,0 @@ -{"uid":"f619b88d74382886","name":"Testing permute_a_palindrome (positive)","fullName":"kyu_6.permute_a_palindrome.test_permute_a_palindrome.PermutePalindromeTestCase#test_permute_a_palindrome_positive","historyId":"faf1054cf60e3f1fbb45c8dc0ece579f","time":{"start":1724735128868,"stop":1724735128868,"duration":0},"description":"\n Testing permute_a_palindrome function\n :return:\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing 'is_isogram' function\n ","descriptionHtml":"Verify that the function that determines corectly whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
","status":"passed","steps":[{"name":"Enter a test string Dermatoglyphics and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string aba and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string moOse and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string isIsogram and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test string and verify the result","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"51739cb22fa4b9dd","name":"stdout","source":"51739cb22fa4b9dd.txt","type":"text/plain","size":401}],"parameters":[],"stepsCount":6,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_IsIsogramTestCase::0","time":{"start":1724735129149,"stop":1724735129149,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"epic","value":"7 kyu"},{"name":"subSuite","value":"Unit Tests"},{"name":"feature","value":"String"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Fundamentals"},{"name":"story","value":"Isograms"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_7.isograms.test_is_isogram"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/54ba84be607a92aa900000f1/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","FUNDAMENTALS"]},"source":"f6dea82ce819c148.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fc455123cb448d3e.json b/allure-report/data/test-cases/f6df3cbfc02e5094.json similarity index 60% rename from allure-report/data/test-cases/fc455123cb448d3e.json rename to allure-report/data/test-cases/f6df3cbfc02e5094.json index a83849c024d..c2c9abaaf84 100644 --- a/allure-report/data/test-cases/fc455123cb448d3e.json +++ b/allure-report/data/test-cases/f6df3cbfc02e5094.json @@ -1 +1 @@ -{"uid":"fc455123cb448d3e","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1732428195635,"stop":1732428195635,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sort the odd"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"5fd184f18d9496f9","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}},{"uid":"b921129ad79b857f","status":"passed","time":{"start":1724733474069,"stop":1724733474069,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"31cd5c9e8017f83c","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}},{"uid":"1ef3e1da7f90eb82","status":"passed","time":{"start":1724735128914,"stop":1724735128930,"duration":16}}]},"tags":["FUNDAMENTALS","ARRAYS"]},"source":"fc455123cb448d3e.json","parameterValues":[]} \ No newline at end of file +{"uid":"f6df3cbfc02e5094","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1732428195634,"stop":1732428195634,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1732428195635,"stop":1732428195635,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"subSuite","value":"Unit Tests"},{"name":"epic","value":"6 kyu"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"story","value":"Sort the odd"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"f6df3cbfc02e5094.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/9b1bc0b9a480db3e.json b/allure-report/data/test-cases/f71bd4516df37f52.json similarity index 85% rename from allure-report/data/test-cases/9b1bc0b9a480db3e.json rename to allure-report/data/test-cases/f71bd4516df37f52.json index e196c6dad75..691f39b2e17 100644 --- a/allure-report/data/test-cases/9b1bc0b9a480db3e.json +++ b/allure-report/data/test-cases/f71bd4516df37f52.json @@ -1 +1 @@ -{"uid":"9b1bc0b9a480db3e","name":"Testing growing_plant function","fullName":"kyu_7.growing_plant.test_growing_plant.GrowingPlantTestCase#test_growing_plant","historyId":"ed63cab09a5a21abc4139e6751f28e54","time":{"start":1724735129133,"stop":1724735129133,"duration":0},"description":"\n Testing growing_plant function\n\n Task\n\n Each day a plant is growing by upSpeed meters.\n Each night that plant's height decreases by downSpeed\n meters due to the lack of sun heat. Initially, plant\n is 0 meters tall. We plant the seed at the beginning\n of a day. We want to know when the height of the plant\n will reach a certain level.\n\n Example\n\n For upSpeed = 100, downSpeed = 10 and desiredHeight = 910,\n the output should be 10.\n\n For upSpeed = 10, downSpeed = 9 and desiredHeight = 4,\n the output should be 1. Because the plant reach to the desired\n height at day 1(10 meters).\n\n Input/Output\n\n [input] integer upSpeed\n A positive integer representing the daily growth.\n Constraints: 5 ≤ upSpeed ≤ 100.\n\n [input] integer downSpeed\n A positive integer representing the nightly decline.\n Constraints: 2 ≤ downSpeed < upSpeed.\n\n [input] integer desiredHeight\n A positive integer representing the threshold.\n Constraints: 4 ≤ desiredHeight ≤ 1000.\n\n [output] an integer\n\n The number of days that it will take for the plant to\n reach/pass desiredHeight (including the last day in the\n total count).\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1732428196335,"stop":1732428196335,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing fix_the_meerkat function with various test data\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1732428196337,"stop":1732428196337,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"My head is at the wrong end!"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"73db1f36a5925004","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}},{"uid":"acf49fc01f491be4","status":"passed","time":{"start":1724733474850,"stop":1724733474850,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"deed80da6e08bd69","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}},{"uid":"1152e12f582a6d83","status":"passed","time":{"start":1724735129617,"stop":1724735129617,"duration":0}}]},"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"9c241cc9403723af.json","parameterValues":[]} \ No newline at end of file +{"uid":"f7d9041670997ad6","name":"fix_the_meerkat function function verification","fullName":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat.FixTheMeerkatTestCase#test_fix_the_meerkat","historyId":"11e49f45979df22d4f121435101e70bc","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"description":"\n Testing fix_the_meerkat function with various test data\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase","time":{"start":1732428196335,"stop":1732428196335,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing fix_the_meerkat function with various test data\n :return:\n ","descriptionHtml":"Save the animals by switching them back. You will be given an array which will have three values (tail, body, head). It is your job to re-arrange the array so that the animal is the right way round (head, body, tail).
","status":"passed","steps":[{"name":"Enter test data: ['tail', 'body', 'head'] and assert actual result: ['head', 'body', 'tail'] vs expected: ['head', 'body', 'tail']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['tails', 'body', 'heads'] and assert actual result: ['heads', 'body', 'tails'] vs expected: ['heads', 'body', 'tails']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['bottom', 'middle', 'top'] and assert actual result: ['top', 'middle', 'bottom'] vs expected: ['top', 'middle', 'bottom']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['lower legs', 'torso', 'upper legs'] and assert actual result: ['upper legs', 'torso', 'lower legs'] vs expected: ['upper legs', 'torso', 'lower legs']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data: ['ground', 'rainbow', 'sky'] and assert actual result: ['sky', 'rainbow', 'ground'] vs expected: ['sky', 'rainbow', 'ground']","time":{"start":1732428196336,"stop":1732428196336,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_FixTheMeerkatTestCase::0","time":{"start":1732428196337,"stop":1732428196337,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"suite","value":"Data Structures"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"DATA STRUCTURES"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"My head is at the wrong end!"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.my_head_is_at_the_wrong_end.test_fix_the_meerkat"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/56f699cd9400f5b7d8000b55","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["LISTS","ALGORITHMS","DATA STRUCTURES","ARRAYS"]},"source":"f7d9041670997ad6.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8cdb3386cf094e1f.json b/allure-report/data/test-cases/f7f7ddd6c717f082.json similarity index 81% rename from allure-report/data/test-cases/8cdb3386cf094e1f.json rename to allure-report/data/test-cases/f7f7ddd6c717f082.json index 2c99f8e1812..eb8b913ee90 100644 --- a/allure-report/data/test-cases/8cdb3386cf094e1f.json +++ b/allure-report/data/test-cases/f7f7ddd6c717f082.json @@ -1 +1 @@ -{"uid":"8cdb3386cf094e1f","name":"Testing dirReduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"519607e9e5d7219c","name":"stdout","source":"519607e9e5d7219c.txt","type":"text/plain","size":204}],"parameters":[],"hasContent":true,"stepsCount":2,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"8cdb3386cf094e1f.json","parameterValues":[]} \ No newline at end of file +{"uid":"f7f7ddd6c717f082","name":"Testing dirReduc function","fullName":"kyu_5.directions_reduction.test_directions_reduction.DirectionsReductionTestCase#test_directions_reduction","historyId":"b49a06236d1af1a464e84083e52f6b22","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Test a function dirReduc which will take an array of\n strings and returns an array of strings with the needless\n directions removed (W<->E or S<->N side by side).\n\n The Haskell version takes a list of directions with\n data Direction = North | East | West | South.\n\n The Clojure version returns nil when the path is\n reduced to nothing.\n\n The Rust version takes a slice of enum Direction\n {NORTH, SOUTH, EAST, WEST}.\n :return:\n ","descriptionHtml":"Test a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
","status":"passed","steps":[{"name":"Enter test data (['WEST']) and verify the output (['WEST']) vs expected (['WEST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter test data (['NORTH', 'WEST', 'SOUTH', 'EAST']) and verify the output (['NORTH', 'WEST', 'SOUTH', 'EAST']) vs expected (['NORTH', 'WEST', 'SOUTH', 'EAST'])","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"84790cd414c0264a","name":"stdout","source":"84790cd414c0264a.txt","type":"text/plain","size":204}],"parameters":[],"stepsCount":2,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_DirectionsReductionTestCase::0","time":{"start":1724733472593,"stop":1724733472593,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"story","value":"Directions Reduction"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.directions_reduction.test_directions_reduction"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/550f22f4d758534c1100025a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS"]},"source":"f7f7ddd6c717f082.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/8e17b24d548befe2.json b/allure-report/data/test-cases/f801b2352cd357fc.json similarity index 76% rename from allure-report/data/test-cases/8e17b24d548befe2.json rename to allure-report/data/test-cases/f801b2352cd357fc.json index 197076101c1..c4bf7e162f4 100644 --- a/allure-report/data/test-cases/8e17b24d548befe2.json +++ b/allure-report/data/test-cases/f801b2352cd357fc.json @@ -1 +1 @@ -{"uid":"8e17b24d548befe2","name":"Testing hoop_count function (positive test case)","fullName":"kyu_8.keep_up_the_hoop.test_hoop_count.HoopCountTestCase#test_hoop_count_positive","historyId":"4110170ab332498939ad9f2d0f38cf97","time":{"start":1724733474804,"stop":1724733474804,"duration":0},"description":"\n Testing hoop_count function\n\n Alex just got a new hula hoop, he loves it but feels\n discouraged because his little brother is better than him\n\n Write a program where Alex can input (n) how many times\n the hoop goes round and it will return him an encouraging message\n\n - If Alex gets 10 or more hoops, return the string \"Great, now move on to tricks\".\n - If he doesn't get 10 hoops, return the string \"Keep at it until you get it\".\n\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"945a96aedc88e8fe.json","parameterValues":[]}
\ No newline at end of file
+{"uid":"f9778b72019f6060","name":"test_ips_between","fullName":"kyu_5.count_ip_addresses.test_ips_between.IpsBetweenTestCase#test_ips_between","historyId":"164912053c696e73c7be4b3a14287ecc","time":{"start":1724735127453,"stop":1724735127453,"duration":0},"description":"\n Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n ","descriptionHtml":" Testing ips_between function\n\n Testing a function that receives two IPv4 addresses,\n and returns the number of addresses between them\n (including the first one, excluding the last one).\n\n All inputs will be valid IPv4 addresses in the form\n of strings. The last address will always be greater\n than the first one.\n :return:\n
\n","status":"skipped","statusMessage":"Skipped: The solution is not ready","statusTrace":"('C:\\\\Users\\\\super\\\\Documents\\\\GitHub\\\\codewars\\\\kyu_5\\\\count_ip_addresses\\\\test_ips_between.py', 29, 'Skipped: The solution is not ready')","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[],"afterStages":[],"labels":[{"name":"tag","value":"ALGORITHMS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Count IP Addresses"},{"name":"tag","value":"PARSING"},{"name":"feature","value":"String"},{"name":"parentSuite","value":"Novice"},{"name":"tag","value":"STRINGS"},{"name":"suite","value":"Algorithms"},{"name":"epic","value":"5 kyu"},{"name":"tag","value":"@pytest.mark.skip(reason='The solution is not ready')"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"9168-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_5.count_ip_addresses.test_ips_between"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/526989a41034285187000de4/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","PARSING","ALGORITHMS","@pytest.mark.skip(reason='The solution is not ready')"]},"source":"f9778b72019f6060.json","parameterValues":[]}
\ No newline at end of file
diff --git a/allure-report/data/test-cases/f9df20ba5fd613f1.json b/allure-report/data/test-cases/f9df20ba5fd613f1.json
deleted file mode 100644
index 0c7368481c9..00000000000
--- a/allure-report/data/test-cases/f9df20ba5fd613f1.json
+++ /dev/null
@@ -1 +0,0 @@
-{"uid":"f9df20ba5fd613f1","name":"Testing decipher_this function","fullName":"kyu_6.decipher_this.test_decipher_this.DecipherThisTestCase#test_decipher_this","historyId":"ae3e8fd54712dd8496499b7bc14e7226","time":{"start":1724735128031,"stop":1724735128031,"duration":0},"description":"\n Testing decipher_this function\n :param self:\n :return:\n ","descriptionHtml":"Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Given a secret message that you need to decipher.
For each word:
* the second and the last letter is switched (e.g. Hello becomes Holle)
* the first letter is replaced by its character code (e.g. H becomes 72)
Note: there are no special characters used, only letters and spaces.
Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"d6c5e78c2bca1b60","name":"stdout","source":"d6c5e78c2bca1b60.txt","type":"text/plain","size":2146}],"parameters":[],"hasContent":true,"stepsCount":5,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Array to HTML table"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"16a9ca9919e5cef5.json","parameterValues":[]} \ No newline at end of file +{"uid":"fa5cd4b7c764fede","name":"Testing to_table function","fullName":"kyu_6.array_to_html_table.test_list_to_html_table.ArrayToTableTestCase#test_array_to_table_function","historyId":"d7b951f3d87d7ec30599f08ae5567eb7","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase","time":{"start":1724733473061,"stop":1724733473061,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"descriptionHtml":"Test that function takes three arguments (data, header, index) and returns a string containing HTML tags representing the table.
","status":"passed","steps":[{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a test data and verify the expected output vs actual result","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"2f6f124c7be3a6e5","name":"stdout","source":"2f6f124c7be3a6e5.txt","type":"text/plain","size":2146}],"parameters":[],"stepsCount":5,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_ArrayToTableTestCase::0","time":{"start":1724733473077,"stop":1724733473077,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"LISTS"},{"name":"tag","value":"ARRAYS"},{"name":"parentSuite","value":"Novice"},{"name":"epic","value":"6 kyu"},{"name":"suite","value":"Fundamentals"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Array to HTML table"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.array_to_html_table.test_list_to_html_table"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/5e7e4b7cd889f7001728fd4a/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","LISTS","ARRAYS"]},"source":"fa5cd4b7c764fede.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/fa69c95248558058.json b/allure-report/data/test-cases/fa69c95248558058.json new file mode 100644 index 00000000000..b53cc09a4b0 --- /dev/null +++ b/allure-report/data/test-cases/fa69c95248558058.json @@ -0,0 +1 @@ +{"uid":"fa69c95248558058","name":"Testing duplicate_encode function","fullName":"kyu_6.duplicate_encoder.test_duplicate_encode.DuplicateEncodeTestCase#test_duplicate_encode","historyId":"fa07af113ba280dc5a89690a520b3897","time":{"start":1724733473202,"stop":1724733473202,"duration":0},"description":"\n Testing duplicate_encode function\n with various test inputs\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[{"uid":"f329250c4d2cb198","name":"stdout","source":"f329250c4d2cb198.txt","type":"text/plain","size":243}],"parameters":[],"hasContent":true,"stepsCount":3,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":1},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"b921129ad79b857f.json","parameterValues":[]} \ No newline at end of file +{"uid":"fe040c66880e0b15","name":"Testing the 'sort_array' function","fullName":"kyu_6.sort_the_odd.test_sort_array.SortArrayTestCase#test_sort_array","historyId":"ac7e79f0af8659ddbaffd6954aed70a9","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n The 'sort_array' function.\n\n The task is to sort ascending odd numbers but\n even numbers must be on their places.\n\n Zero isn't an odd number and you don't need to\n move it. If you have an empty array, you need\n to return it.\n\n :return:\n ","descriptionHtml":"The task is to sort ascending odd numbers but even numbers must be on their places.
","status":"passed","steps":[{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false},{"name":"Enter a list and verify the expected output vs actual result","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[{"uid":"cc532e29d77b891e","name":"stdout","source":"cc532e29d77b891e.txt","type":"text/plain","size":243}],"parameters":[],"stepsCount":3,"attachmentStep":false,"hasContent":true,"attachmentsCount":1,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SortArrayTestCase::0","time":{"start":1724733474069,"stop":1724733474069,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"Lists"},{"name":"tag","value":"ARRAYS"},{"name":"epic","value":"6 kyu"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Algorithms"},{"name":"subSuite","value":"Unit Tests"},{"name":"story","value":"Sort the odd"},{"name":"parentSuite","value":"Novice"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"17192-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_6.sort_the_odd.test_sort_array"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/578aa45ee9fd15ff4600090d/train/python","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["FUNDAMENTALS","ARRAYS"]},"source":"fe040c66880e0b15.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/2951c359ba3fd421.json b/allure-report/data/test-cases/fe07573cd07e1ed8.json similarity index 65% rename from allure-report/data/test-cases/2951c359ba3fd421.json rename to allure-report/data/test-cases/fe07573cd07e1ed8.json index 7c0a39d4fef..478bc5b512a 100644 --- a/allure-report/data/test-cases/2951c359ba3fd421.json +++ b/allure-report/data/test-cases/fe07573cd07e1ed8.json @@ -1 +1 @@ -{"uid":"2951c359ba3fd421","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1732428196238,"stop":1732428196239,"duration":1},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":2,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196238,"stop":1732428196238,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"attachments":[],"parameters":[],"hasContent":true,"stepsCount":1,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"hasContent":false,"stepsCount":0,"attachmentStep":false,"shouldDisplayMessage":false,"attachmentsCount":0}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":false,"retry":false,"extra":{"severity":"normal","retries":[{"uid":"48abcc67292a5aa2","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"5b3fc84157197066","status":"passed","time":{"start":1724733474741,"stop":1724733474741,"duration":0}}],"categories":[],"history":{"statistic":{"failed":0,"broken":0,"skipped":0,"passed":3,"unknown":0,"total":3},"items":[{"uid":"972d0622d29729c4","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}},{"uid":"2c2a3e42bb3933c8","status":"passed","time":{"start":1724735129524,"stop":1724735129524,"duration":0}}]},"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"2951c359ba3fd421.json","parameterValues":[]} \ No newline at end of file +{"uid":"fe07573cd07e1ed8","name":"Testing shark function (positive)","fullName":"kyu_8.holiday_vi_shark_pontoon.test_shark.SharkTestCase#test_shark_alive_1","historyId":"ef9f0d6b554a403890075cafa527f60a","time":{"start":1732428196238,"stop":1732428196239,"duration":1},"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","flaky":false,"newFailed":false,"newBroken":false,"newPassed":false,"retriesCount":0,"retriesStatusChange":false,"beforeStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase","time":{"start":1732428196237,"stop":1732428196237,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"testStage":{"description":"\n Testing shark function -> positive\n :return:\n ","descriptionHtml":"You are given 5 variables:
shark_distance = distance the shark needs to cover to eat you in metres,
shark_speed = how fast it can move in metres/second,
pontoonDistance = how far you need to swim to safety in metres,
you_speed = how fast you can swim in metres/second,
dolphin = a boolean, if true, you can half the swimming speed of the shark as the dolphin will attack it.
If you make it, return \"Alive!\", if not, return \"Shark Bait!\".
","status":"passed","steps":[{"name":"Enter test data and verify the output","time":{"start":1732428196238,"stop":1732428196238,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"attachments":[],"parameters":[],"stepsCount":1,"attachmentStep":false,"hasContent":true,"attachmentsCount":0,"shouldDisplayMessage":false},"afterStages":[{"name":"_unittest_setUpClass_fixture_SharkTestCase::0","time":{"start":1732428196251,"stop":1732428196251,"duration":0},"status":"passed","steps":[],"attachments":[],"parameters":[],"stepsCount":0,"attachmentStep":false,"hasContent":false,"attachmentsCount":0,"shouldDisplayMessage":false}],"labels":[{"name":"severity","value":"normal"},{"name":"feature","value":"String"},{"name":"epic","value":"8 kyu"},{"name":"parentSuite","value":"Beginner"},{"name":"tag","value":"ALGORITHMS"},{"name":"tag","value":"STRINGS"},{"name":"story","value":"Holiday VI - Shark Pontoon"},{"name":"subSuite","value":"Unit Tests"},{"name":"tag","value":"NUMBERS"},{"name":"tag","value":"MATHEMATICS"},{"name":"tag","value":"FUNDAMENTALS"},{"name":"suite","value":"Math"},{"name":"host","value":"DESKTOP-I2O0REL"},{"name":"thread","value":"12720-MainThread"},{"name":"framework","value":"pytest"},{"name":"language","value":"cpython3"},{"name":"package","value":"kyu_8.holiday_vi_shark_pontoon.test_shark"},{"name":"resultFormat","value":"allure2"}],"parameters":[],"links":[{"name":"Source/Kata","url":"https://www.codewars.com/kata/57e921d8b36340f1fd000059","type":"link"}],"hidden":true,"retry":true,"extra":{"categories":[],"tags":["STRINGS","MATHEMATICS","FUNDAMENTALS","NUMBERS","ALGORITHMS"]},"source":"fe07573cd07e1ed8.json","parameterValues":[]} \ No newline at end of file diff --git a/allure-report/data/test-cases/5998f9acb6d6dab8.json b/allure-report/data/test-cases/fe13696efb68455a.json similarity index 68% rename from allure-report/data/test-cases/5998f9acb6d6dab8.json rename to allure-report/data/test-cases/fe13696efb68455a.json index 19b9bd1aedf..270ad76e93d 100644 --- a/allure-report/data/test-cases/5998f9acb6d6dab8.json +++ b/allure-report/data/test-cases/fe13696efb68455a.json @@ -1 +1 @@ -{"uid":"5998f9acb6d6dab8","name":"Test with one char only","fullName":"kyu_8.reversed_strings.test_reversed_strings.ReversedStringsTestCase#test_reversed_strings_one_char","historyId":"e3d629a995491cb3a3079998a04583ff","time":{"start":1724735129649,"stop":1724735129649,"duration":0},"description":"\n Test with one char only\n :return:\n ","descriptionHtml":"