summary refs log tree commit diff
path: root/synapse/util/iterutils.py
diff options
context:
space:
mode:
authordependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>2025-05-20 15:23:30 +0100
committerGitHub <noreply@github.com>2025-05-20 15:23:30 +0100
commit9d43bec3268d9a454fe992f25edfc013a50fb9cc (patch)
tree5d4b9439ff14b83ce352c829a83097d9ffe034a1 /synapse/util/iterutils.py
parentUpdate postgres.md (#18445) (diff)
downloadsynapse-9d43bec3268d9a454fe992f25edfc013a50fb9cc.tar.xz
Bump ruff from 0.7.3 to 0.11.10 (#18451)
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
Co-authored-by: Andrew Morgan <andrew@amorgan.xyz>
Co-authored-by: Andrew Morgan <1342360+anoadragon453@users.noreply.github.com>
Diffstat (limited to 'synapse/util/iterutils.py')
-rw-r--r--synapse/util/iterutils.py4
1 files changed, 2 insertions, 2 deletions
diff --git a/synapse/util/iterutils.py b/synapse/util/iterutils.py

index ff6adeb716..0a6a30aab2 100644 --- a/synapse/util/iterutils.py +++ b/synapse/util/iterutils.py
@@ -114,7 +114,7 @@ def sorted_topologically( # This is implemented by Kahn's algorithm. - degree_map = {node: 0 for node in nodes} + degree_map = dict.fromkeys(nodes, 0) reverse_graph: Dict[T, Set[T]] = {} for node, edges in graph.items(): @@ -164,7 +164,7 @@ def sorted_topologically_batched( persisted. """ - degree_map = {node: 0 for node in nodes} + degree_map = dict.fromkeys(nodes, 0) reverse_graph: Dict[T, Set[T]] = {} for node, edges in graph.items():