summary refs log tree commit diff
path: root/tests/util
diff options
context:
space:
mode:
authorDan Callahan <danc@element.io>2021-01-26 15:38:22 +0000
committerDan Callahan <danc@element.io>2021-01-26 15:38:22 +0000
commita06dd1d6b5a36a473ad58c186cac61ba929dc154 (patch)
tree5a8d355e61b47803acbc8cfabf391b4059b29dcf /tests/util
parentFix state endpoint to be faster (diff)
parentTweak changes. (diff)
downloadsynapse-github/travis/fosdem/hotfixes.tar.xz
Merge tag 'v1.26.0rc2' into travis/fosdem/hotfixes github/travis/fosdem/hotfixes travis/fosdem/hotfixes
Diffstat (limited to '')
-rw-r--r--tests/util/test_itertools.py12
-rw-r--r--tests/utils.py1
2 files changed, 12 insertions, 1 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]) diff --git a/tests/utils.py b/tests/utils.py
index 977eeaf6ee..09614093bc 100644 --- a/tests/utils.py +++ b/tests/utils.py
@@ -159,7 +159,6 @@ def default_config(name, parse=False): "remote": {"per_second": 10000, "burst_count": 10000}, }, "saml2_enabled": False, - "public_baseurl": None, "default_identity_server": None, "key_refresh_interval": 24 * 60 * 60 * 1000, "old_signing_keys": {},