OpenCloud
/
MatrixSynapse
mirror of https://github.com/matrix-org/synapse
1
0
Fork 0
Code Issues Releases Wiki Activity

Fix typos 

Co-Authored-By: Matthew Hodgson <matthew@matrix.org>
pull/7095/head
Erik Johnston 2020-03-18 09:46:17 +00:00 committed by GitHub
parent bd2e18ad25
commit d373279c96
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
synapse/storage/data_stores/main/event_federation.py
View File

@ -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.

2
tests/storage/test_event_federation.py
View File

@ -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