forked from MirrorHub/synapse
f85b6ca494
Instead of calculating the size of the cache repeatedly, which can take a long time now that it can use a callback, instead cache the size and update that on insertion and deletion. This requires changing the cache descriptors to have two caches, one for pending deferreds and the other for the actual values. There's no reason to evict from the pending deferreds as they won't take up any more memory. |
||
---|---|---|
.. | ||
__init__.py | ||
test_dict_cache.py | ||
test_expiring_cache.py | ||
test_limiter.py | ||
test_linearizer.py | ||
test_log_context.py | ||
test_lrucache.py | ||
test_rwlock.py | ||
test_snapshot_cache.py | ||
test_treecache.py | ||
test_wheel_timer.py |