alihan/textual
1
0
Fork 0
mirror of https://github.com/Textualize/textual.git synced 2025-10-17 02:38:12 +03:00
Code Issues Packages Projects Releases Wiki Activity

fix slots

Browse Source
This commit is contained in:
Will McGugan
2022-12-28 15:20:10 +00:00
parent f0ddf6368c
commit f102fcb829
1 changed files with 10 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/textual/_cache.py
View File

@@ -36,6 +36,15 @@ class LRUCache(Generic[CacheKey, CacheValue]):
""" """
__slots__ = [
"_maxsize",
"_cache",
"_full",
"_head",
"hits",
"misses",
]
def __init__(self, maxsize: int) -> None: def __init__(self, maxsize: int) -> None:
self._maxsize = maxsize self._maxsize = maxsize
self._cache: Dict[CacheKey, list[object]] = {} self._cache: Dict[CacheKey, list[object]] = {}
@@ -172,7 +181,7 @@ class LRUCache(Generic[CacheKey, CacheValue]):
class FIFOCache(Generic[CacheKey, CacheValue]): class FIFOCache(Generic[CacheKey, CacheValue]):
"""A simple cache that discards the least recently added key when full. """A simple cache that discards the first added key when full (First In First Out).
This has a lower overhead than LRUCache, but won't manage a working set as efficiently. This has a lower overhead than LRUCache, but won't manage a working set as efficiently.
It is most suitable for a cache with a relatively low maximum size that is not expected to It is most suitable for a cache with a relatively low maximum size that is not expected to
@@ -185,7 +194,6 @@ class FIFOCache(Generic[CacheKey, CacheValue]):
__slots__ = [ __slots__ = [
"_maxsize", "_maxsize",
"_cache", "_cache",
"_lock",
"hits", "hits",
"misses", "misses",
] ]