From d373279c965addb92ae52f235f3cedfb9e243c08 Mon Sep 17 00:00:00 2001 From: Erik Johnston Date: Wed, 18 Mar 2020 09:46:17 +0000 Subject: [PATCH] Fix typos Co-Authored-By: Matthew Hodgson --- synapse/storage/data_stores/main/event_federation.py | 4 ++-- tests/storage/test_event_federation.py | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/synapse/storage/data_stores/main/event_federation.py b/synapse/storage/data_stores/main/event_federation.py index 68a95c3a4f..0813b619eb 100644 --- a/synapse/storage/data_stores/main/event_federation.py +++ b/synapse/storage/data_stores/main/event_federation.py @@ -148,7 +148,7 @@ class EventFederationWorkerStore(EventsWorkerStore, SignatureWorkerStore, SQLBas # B -´---------´ # # and state sets {A} and {B} then walking the auth chains of A and B - # would immediatley show that C is reachable by both. However, if we + # would immediately show that C is reachable by both. However, if we # stopped at C then we'd only reach E via the auth chain of B and so E # would errornously get included in the returned difference. # @@ -159,7 +159,7 @@ class EventFederationWorkerStore(EventsWorkerStore, SignatureWorkerStore, SQLBas # lower depth are likely reachable by those with higher depths. # # We could use any ordering that we believe would give a rough - # toplogical ordfering, e.g. origin server timestamp. If the ordering + # topological ordering, e.g. origin server timestamp. If the ordering # chosen is not topological then the algorithm still produces the right # result, but perhaps a bit more inefficiently. This is why it is safe # to use "depth" here. diff --git a/tests/storage/test_event_federation.py b/tests/storage/test_event_federation.py index 6d638572cb..3aeec0dc0f 100644 --- a/tests/storage/test_event_federation.py +++ b/tests/storage/test_event_federation.py @@ -114,7 +114,7 @@ class EventFederationWorkerStoreTestCase(tests.unittest.HomeserverTestCase): def test_auth_difference(self): room_id = "@ROOM:local" - # The silly auth graph we use to test th eauth difference algorithm, + # The silly auth graph we use to test the auth difference algorithm, # where the top are the most recent events. # # A B