4a17a647a9
It was originally implemented by pulling the full auth chain of all state sets out of the database and doing set comparison. However, that can take a lot work if the state and auth chains are large. Instead, lets try and fetch the auth chains at the same time and calculate the difference on the fly, allowing us to bail early if all the auth chains converge. Assuming that the auth chains do converge more often than not, this should improve performance. Hopefully. |
||
|---|---|---|
| .. | ||
| data_stores | ||
| engines | ||
| schema | ||
| util | ||
| __init__.py | ||
| _base.py | ||
| background_updates.py | ||
| database.py | ||
| keys.py | ||
| persist_events.py | ||
| prepare_database.py | ||
| presence.py | ||
| purge_events.py | ||
| push_rule.py | ||
| relations.py | ||
| roommember.py | ||
| state.py | ||
| types.py | ||