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

pep8

pull/7095/head
Erik Johnston 2020-03-18 15:18:17 +00:00
parent f47a4177e0
commit b20946666b
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -14,7 +14,7 @@
# limitations under the License. # limitations under the License.
import itertools import itertools
import logging import logging
from typing import Dict, List, Optional, Set from typing import Dict, List, Optional, Set, Tuple
from six.moves.queue import Empty, PriorityQueue from six.moves.queue import Empty, PriorityQueue
@ -185,7 +185,7 @@ class EventFederationWorkerStore(EventsWorkerStore, SignatureWorkerStore, SQLBas
txn.execute(sql % (clause,), args) txn.execute(sql % (clause,), args)
# The sorted list of events whose auth chains we should walk. # The sorted list of events whose auth chains we should walk.
search = txn.fetchall() # type: List[Tuple[int, str]] search = txn.fetchall() # type: List[Tuple[int, str]]
# Map from event to its auth events # Map from event to its auth events
event_to_auth_events = {} # type: Dict[str, Set[str]] event_to_auth_events = {} # type: Dict[str, Set[str]]
@ -222,7 +222,9 @@ class EventFederationWorkerStore(EventsWorkerStore, SignatureWorkerStore, SQLBas
# Assume that this event is unreachable from any of the # Assume that this event is unreachable from any of the
# state sets until proven otherwise # state sets until proven otherwise
sets = event_to_missing_sets[auth_event_id] = set(range(len(state_sets))) sets = event_to_missing_sets[auth_event_id] = set(
range(len(state_sets))
)
else: else:
# We've previously seen this event, so look up its auth # We've previously seen this event, so look up its auth
# events and recursively mark all ancestors as reachable # events and recursively mark all ancestors as reachable