Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Add types to synapse.util. (#10601) | reivilibre | 2021-09-10 | 1 | -8/+8 |
| | |||||
* | [pyupgrade] `synapse/` (#10348) | Jonathan de Jong | 2021-07-19 | 1 | -2/+1 |
| | | | | | | | | | This PR is tantamount to running ``` pyupgrade --py36-plus --keep-percent-format `find synapse/ -type f -name "*.py"` ``` Part of #9744 | ||||
* | Combine `LruCache.invalidate` and `invalidate_many` (#9973) | Richard van der Hoff | 2021-05-27 | 1 | -0/+3 |
| | | | | | | | | | | * Make `invalidate` and `invalidate_many` do the same thing ... so that we can do either over the invalidation replication stream, and also because they always confused me a bit. * Kill off `invalidate_many` * changelog | ||||
* | Remove `keylen` from `LruCache`. (#9993) | Richard van der Hoff | 2021-05-24 | 1 | -38/+66 |
| | | | | | | | `keylen` seems to be a thing that is frequently incorrectly set, and we don't really need it. The only time it was used was to figure out if we had removed a subtree in `del_multi`, which we can do better by changing `TreeCache.pop` to return a different type (`TreeCacheNode`). Commits should be independently reviewable. | ||||
* | Stop sub-classing object (#8249) | Patrick Cloke | 2020-09-04 | 1 | -2/+2 |
| | |||||
* | Replace iteritems/itervalues/iterkeys with native versions. (#7692) | Patrick Cloke | 2020-06-15 | 1 | -3/+1 |
| | |||||
* | Fix up some typechecking (#6150) | Amber Brown | 2019-10-02 | 1 | -1/+3 |
| | | | | | | * type checking fixes * changelog | ||||
* | Run Black. (#5482) | Amber Brown | 2019-06-20 | 1 | -0/+1 |
| | |||||
* | Consistently use six's iteritems and wrap lazy keys/values in list() if ↵ | Amber Brown | 2018-05-31 | 1 | -2/+4 |
| | | | | they're not meant to be lazy (#3307) | ||||
* | Rename and comment tree_to_leaves_iterator | Erik Johnston | 2017-01-17 | 1 | -3/+6 |
| | |||||
* | Speed up cache size calculation | Erik Johnston | 2017-01-17 | 1 | -1/+13 |
| | | | | | | | | | | | 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. | ||||
* | Add concept of cache contexts | Erik Johnston | 2016-08-19 | 1 | -0/+3 |
| | |||||
* | Fix flake8 warnings for new flake8 | Daniel Wagner-Hall | 2016-02-02 | 1 | -1/+1 |
| | |||||
* | Directly set self.value | Erik Johnston | 2016-01-29 | 1 | -1/+1 |
| | |||||
* | Correctly bookkeep the size of TreeCache | Erik Johnston | 2016-01-29 | 1 | -3/+28 |
| | |||||
* | Make TreeCache keep track of its own size. | Erik Johnston | 2016-01-29 | 1 | -0/+7 |
| | |||||
* | Add __contains__ | David Baker | 2016-01-22 | 1 | -0/+3 |
| | |||||
* | Docs for treecache | David Baker | 2016-01-22 | 1 | -0/+5 |
| | |||||
* | peppate | David Baker | 2016-01-21 | 1 | -2/+2 |
| | |||||
* | Change LRUCache to be tree-based so we can delete subtrees. | David Baker | 2016-01-21 | 1 | -0/+52 |