15 Commits (59e2d2694deec13aaa0062e04b5460f978967dc1)

Author	SHA1	Message	Date
black	8b3d9b6b19	Run black.	8 years ago
Amber Brown	49af402019	run isort	8 years ago
Erik Johnston	9e8e236d98	Tidy up test	9 years ago
Erik Johnston	f85b6ca494	Speed up cache size calculation ... 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.	9 years ago
Erik Johnston	2fae34bd2c	Optionally measure size of cache by sum of length of values	9 years ago
Erik Johnston	45fd2c8942	Ensure invalidation list does not grow unboundedly	10 years ago
Erik Johnston	4161ff2fc4	Add concept of cache contexts	10 years ago
Erik Johnston	4fce59f274	Add tests	10 years ago
David Baker	d552861346	Revert all the bits changing keys of eeverything that used LRUCaches to tuples	10 years ago
David Baker	10f76dc5da	Make LRU cache not default to treecache & add options to use it	10 years ago
David Baker	31a051b677	Test treecache directly	10 years ago
David Baker	f1f8122120	Change LRUCache to be tree-based so we can delete subtrees.	10 years ago
Matthew Hodgson	6c28ac260c	copyrights	10 years ago
Erik Johnston	2df8dd9b37	Move all the caches into their own package, synapse.util.caches	11 years ago
Mark Haines	d8324d5a2b	Add a lru cache class	11 years ago