diff options
author | Erik Johnston <erik@matrix.org> | 2021-01-22 19:44:08 +0000 |
---|---|---|
committer | GitHub <noreply@github.com> | 2021-01-22 19:44:08 +0000 |
commit | 056327457ff471495741a539e99c840ed54afccd (patch) | |
tree | 5610162fa592de2044da062ba5a836d9329e2fa0 /tests/util | |
parent | Bump psycopg2 version (#9204) (diff) | |
download | synapse-056327457ff471495741a539e99c840ed54afccd.tar.xz |
Fix chain cover update to handle events with duplicate auth events (#9210)
Diffstat (limited to '')
-rw-r--r-- | tests/util/test_itertools.py | 12 |
1 files changed, 12 insertions, 0 deletions
diff --git a/tests/util/test_itertools.py b/tests/util/test_itertools.py index 522c8061f9..1ef0af8e8f 100644 --- a/tests/util/test_itertools.py +++ b/tests/util/test_itertools.py @@ -92,3 +92,15 @@ class SortTopologically(TestCase): # Valid orderings are `[1, 3, 2, 4]` or `[1, 2, 3, 4]`, but we should # always get the same one. self.assertEqual(list(sorted_topologically([4, 3, 2, 1], graph)), [1, 2, 3, 4]) + + def test_duplicates(self): + "Test that a graph with duplicate edges work" + graph = {1: [], 2: [1, 1], 3: [2, 2], 4: [3]} # type: Dict[int, List[int]] + + self.assertEqual(list(sorted_topologically([4, 3, 2, 1], graph)), [1, 2, 3, 4]) + + def test_multiple_paths(self): + "Test that a graph with multiple paths between two nodes work" + graph = {1: [], 2: [1], 3: [2], 4: [3, 2, 1]} # type: Dict[int, List[int]] + + self.assertEqual(list(sorted_topologically([4, 3, 2, 1], graph)), [1, 2, 3, 4]) |