| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Run Black. (#5482) | Amber Brown | 2019-06-20 | 1 | -2/+12 |
| | | |||||
| * | run isort | Amber Brown | 2018-07-09 | 1 | -1/+1 |
| | | |||||
| * | Add comments | Erik Johnston | 2018-03-19 | 1 | -0/+7 |
| | | |||||
| * | Fix bug where state cache used lots of memory | Erik Johnston | 2018-03-15 | 1 | -4/+4 |
| | | | | | | | | | | The state cache bases its size on the sum of the size of entries. The size of the entry is calculated once on insertion, so it is important that the size of entries does not change. The DictionaryCache modified the entries size, which caused the state cache to incorrectly think it was smaller than it actually was. | ||||
| * | report metrics on number of cache evictions | Richard van der Hoff | 2018-02-05 | 1 | -3/+25 |
| | | |||||
| * | Update LruCache size estimate on clear | Erik Johnston | 2017-01-18 | 1 | -0/+2 |
| | | |||||
| * | Remove needless call to evict() | Erik Johnston | 2017-01-17 | 1 | -1/+0 |
| | | |||||
| * | Speed up cache size calculation | Erik Johnston | 2017-01-17 | 1 | -17/+25 |
| | | | | | | | | | | | | 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 | -14/+18 |
| | | |||||
| * | Ensure invalidation list does not grow unboundedly | Erik Johnston | 2016-08-19 | 1 | -8/+8 |
| | | |||||
| * | Add concept of cache contexts | Erik Johnston | 2016-08-19 | 1 | -7/+32 |
| | | |||||
| * | Make LruCache use a dedicated _Node class | Erik Johnston | 2016-03-22 | 1 | -32/+41 |
| | | |||||
| * | Remove spurious self.size | Erik Johnston | 2016-01-29 | 1 | -1/+0 |
| | | |||||
| * | Make TreeCache keep track of its own size. | Erik Johnston | 2016-01-29 | 1 | -6/+3 |
| | | |||||
| * | Reset size on clear | Erik Johnston | 2016-01-29 | 1 | -0/+2 |
| | | |||||
| * | Don't add the member functiopn if we're not using treecache | David Baker | 2016-01-22 | 1 | -1/+4 |
| | | |||||
| * | docs | David Baker | 2016-01-22 | 1 | -1/+5 |
| | | |||||
| * | Revert all the bits changing keys of eeverything that used LRUCaches to tuples | David Baker | 2016-01-22 | 1 | -1/+1 |
| | | |||||
| * | Make LRU cache not default to treecache & add options to use it | David Baker | 2016-01-22 | 1 | -4/+5 |
| | | |||||
| * | Change LRUCache to be tree-based so we can delete subtrees. | David Baker | 2016-01-21 | 1 | -8/+35 |
| | | |||||
| * | 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 | -0/+149 |
 |
index : matrix/thirdparty/synapse.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summary refs log tree commit diff |