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