Total Complexity | 4 |
Total Lines | 21 |
Duplicated Lines | 0 % |
Changes | 1 | ||
Bugs | 0 | Features | 0 |
1 | import sys |
||
8 | class TestLevenShtein(TestCase): |
||
9 | |||
10 | def same_word_should_equal_zero(self): |
||
11 | diff = levenshtein.levenshtein("hello", "hello") |
||
12 | |||
13 | self.assertEqual(diff, 0) |
||
14 | |||
15 | def zero_words_should_equal_zero(self): |
||
16 | diff = levenshtein.levenshtein("", "") |
||
17 | |||
18 | self.assertEqual(diff, 0) |
||
19 | |||
20 | def first_word_one_longer_should_equal_one(self): |
||
21 | diff = levenshtein.levenshtein("hello", "hell") |
||
22 | |||
23 | self.assertEqual(diff, 1) |
||
24 | |||
25 | def second_word_one_longer_should_equal_one(self): |
||
26 | diff = levenshtein.levenshtein("hell", "hello") |
||
27 | |||
28 | self.assertEqual(diff, 1) |
||
29 |