Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | run isort | Amber Brown | 2018-07-09 | 1 | -2/+2 |
| | |||||
* | Tidy up test | Erik Johnston | 2017-01-17 | 1 | -12/+12 |
| | |||||
* | Speed up cache size calculation | Erik Johnston | 2017-01-17 | 1 | -15/+15 |
| | | | | | | | | | | | 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. | ||||
* | Optionally measure size of cache by sum of length of values | Erik Johnston | 2017-01-13 | 1 | -0/+25 |
| | |||||
* | Ensure invalidation list does not grow unboundedly | Erik Johnston | 2016-08-19 | 1 | -0/+40 |
| | |||||
* | Add concept of cache contexts | Erik Johnston | 2016-08-19 | 1 | -0/+113 |
| | |||||
* | Add tests | Erik Johnston | 2016-01-29 | 1 | -0/+7 |
| | |||||
* | Revert all the bits changing keys of eeverything that used LRUCaches to tuples | David Baker | 2016-01-22 | 1 | -22/+22 |
| | |||||
* | Make LRU cache not default to treecache & add options to use it | David Baker | 2016-01-22 | 1 | -1/+2 |
| | |||||
* | Test treecache directly | David Baker | 2016-01-22 | 1 | -0/+19 |
| | |||||
* | Change LRUCache to be tree-based so we can delete subtrees. | David Baker | 2016-01-21 | 1 | -22/+22 |
| | |||||
* | copyrights | Matthew Hodgson | 2016-01-07 | 1 | -1/+1 |
| | |||||
* | Move all the caches into their own package, synapse.util.caches | Erik Johnston | 2015-08-11 | 1 | -3/+1 |
| | |||||
* | Add a lru cache class | Mark Haines | 2015-02-11 | 1 | -0/+56 |