forked from reingart/exercism
-
Notifications
You must be signed in to change notification settings - Fork 4
/
sublist_test.py
90 lines (65 loc) · 2.95 KB
/
sublist_test.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
# These tests are auto-generated with test data from:
# https://github.com/exercism/problem-specifications/tree/main/exercises/sublist/canonical-data.json
# File last updated on 2023-07-19
import unittest
from sublist import (
sublist,
SUBLIST,
SUPERLIST,
EQUAL,
UNEQUAL,
)
class SublistTest(unittest.TestCase):
def test_empty_lists(self):
self.assertEqual(sublist([], []), EQUAL)
def test_empty_list_within_non_empty_list(self):
self.assertEqual(sublist([], [1, 2, 3]), SUBLIST)
def test_non_empty_list_contains_empty_list(self):
self.assertEqual(sublist([1, 2, 3], []), SUPERLIST)
def test_list_equals_itself(self):
self.assertEqual(sublist([1, 2, 3], [1, 2, 3]), EQUAL)
def test_different_lists(self):
self.assertEqual(sublist([1, 2, 3], [2, 3, 4]), UNEQUAL)
def test_false_start(self):
self.assertEqual(sublist([1, 2, 5], [0, 1, 2, 3, 1, 2, 5, 6]), SUBLIST)
def test_consecutive(self):
self.assertEqual(sublist([1, 1, 2], [0, 1, 1, 1, 2, 1, 2]), SUBLIST)
def test_sublist_at_start(self):
self.assertEqual(sublist([0, 1, 2], [0, 1, 2, 3, 4, 5]), SUBLIST)
def test_sublist_in_middle(self):
self.assertEqual(sublist([2, 3, 4], [0, 1, 2, 3, 4, 5]), SUBLIST)
def test_sublist_at_end(self):
self.assertEqual(sublist([3, 4, 5], [0, 1, 2, 3, 4, 5]), SUBLIST)
def test_at_start_of_superlist(self):
self.assertEqual(sublist([0, 1, 2, 3, 4, 5], [0, 1, 2]), SUPERLIST)
def test_in_middle_of_superlist(self):
self.assertEqual(sublist([0, 1, 2, 3, 4, 5], [2, 3]), SUPERLIST)
def test_at_end_of_superlist(self):
self.assertEqual(sublist([0, 1, 2, 3, 4, 5], [3, 4, 5]), SUPERLIST)
def test_first_list_missing_element_from_second_list(self):
self.assertEqual(sublist([1, 3], [1, 2, 3]), UNEQUAL)
def test_second_list_missing_element_from_first_list(self):
self.assertEqual(sublist([1, 2, 3], [1, 3]), UNEQUAL)
def test_first_list_missing_additional_digits_from_second_list(self):
self.assertEqual(sublist([1, 2], [1, 22]), UNEQUAL)
def test_order_matters_to_a_list(self):
self.assertEqual(sublist([1, 2, 3], [3, 2, 1]), UNEQUAL)
def test_same_digits_but_different_numbers(self):
self.assertEqual(sublist([1, 0, 1], [10, 1]), UNEQUAL)
# Additional tests for this track
def test_unique_return_values(self):
self.assertEqual(len(set([SUBLIST, SUPERLIST, EQUAL, UNEQUAL])), 4)
def test_inner_spaces(self):
self.assertEqual(sublist(["a c"], ["a", "c"]), UNEQUAL)
def test_large_lists(self):
self.assertEqual(
sublist(
list(range(1000)) * 1000 + list(range(1000, 1100)),
list(range(900, 1050)),
),
SUPERLIST,
)
def test_spread_sublist(self):
self.assertEqual(
sublist(list(range(3, 200, 3)), list(range(15, 200, 15))), UNEQUAL
)