Commit 1c858c35 authored by Serhiy Storchaka's avatar Serhiy Storchaka

Issue #14373: Added C implementation of functools.lru_cache(). Based on

patches by Matt Joiner and Alexey Kachayev.
parent c7090855
...@@ -419,12 +419,18 @@ def lru_cache(maxsize=128, typed=False): ...@@ -419,12 +419,18 @@ def lru_cache(maxsize=128, typed=False):
if maxsize is not None and not isinstance(maxsize, int): if maxsize is not None and not isinstance(maxsize, int):
raise TypeError('Expected maxsize to be an integer or None') raise TypeError('Expected maxsize to be an integer or None')
def decorating_function(user_function):
wrapper = _lru_cache_wrapper(user_function, maxsize, typed, _CacheInfo)
return update_wrapper(wrapper, user_function)
return decorating_function
def _lru_cache_wrapper(user_function, maxsize, typed, _CacheInfo):
# Constants shared by all lru cache instances: # Constants shared by all lru cache instances:
sentinel = object() # unique object used to signal cache misses sentinel = object() # unique object used to signal cache misses
make_key = _make_key # build a key from the function arguments make_key = _make_key # build a key from the function arguments
PREV, NEXT, KEY, RESULT = 0, 1, 2, 3 # names for the link fields PREV, NEXT, KEY, RESULT = 0, 1, 2, 3 # names for the link fields
def decorating_function(user_function):
cache = {} cache = {}
hits = misses = 0 hits = misses = 0
full = False full = False
...@@ -532,7 +538,10 @@ def lru_cache(maxsize=128, typed=False): ...@@ -532,7 +538,10 @@ def lru_cache(maxsize=128, typed=False):
wrapper.cache_clear = cache_clear wrapper.cache_clear = cache_clear
return update_wrapper(wrapper, user_function) return update_wrapper(wrapper, user_function)
return decorating_function try:
from _functools import _lru_cache_wrapper
except ImportError:
pass
################################################################################ ################################################################################
......
...@@ -7,6 +7,10 @@ import sys ...@@ -7,6 +7,10 @@ import sys
from test import support from test import support
import unittest import unittest
from weakref import proxy from weakref import proxy
try:
import threading
except ImportError:
threading = None
import functools import functools
...@@ -912,12 +916,12 @@ class Orderable_LT: ...@@ -912,12 +916,12 @@ class Orderable_LT:
return self.value == other.value return self.value == other.value
class TestLRU(unittest.TestCase): class TestLRU:
def test_lru(self): def test_lru(self):
def orig(x, y): def orig(x, y):
return 3 * x + y return 3 * x + y
f = functools.lru_cache(maxsize=20)(orig) f = self.module.lru_cache(maxsize=20)(orig)
hits, misses, maxsize, currsize = f.cache_info() hits, misses, maxsize, currsize = f.cache_info()
self.assertEqual(maxsize, 20) self.assertEqual(maxsize, 20)
self.assertEqual(currsize, 0) self.assertEqual(currsize, 0)
...@@ -955,7 +959,7 @@ class TestLRU(unittest.TestCase): ...@@ -955,7 +959,7 @@ class TestLRU(unittest.TestCase):
self.assertEqual(currsize, 1) self.assertEqual(currsize, 1)
# test size zero (which means "never-cache") # test size zero (which means "never-cache")
@functools.lru_cache(0) @self.module.lru_cache(0)
def f(): def f():
nonlocal f_cnt nonlocal f_cnt
f_cnt += 1 f_cnt += 1
...@@ -971,7 +975,7 @@ class TestLRU(unittest.TestCase): ...@@ -971,7 +975,7 @@ class TestLRU(unittest.TestCase):
self.assertEqual(currsize, 0) self.assertEqual(currsize, 0)
# test size one # test size one
@functools.lru_cache(1) @self.module.lru_cache(1)
def f(): def f():
nonlocal f_cnt nonlocal f_cnt
f_cnt += 1 f_cnt += 1
...@@ -987,7 +991,7 @@ class TestLRU(unittest.TestCase): ...@@ -987,7 +991,7 @@ class TestLRU(unittest.TestCase):
self.assertEqual(currsize, 1) self.assertEqual(currsize, 1)
# test size two # test size two
@functools.lru_cache(2) @self.module.lru_cache(2)
def f(x): def f(x):
nonlocal f_cnt nonlocal f_cnt
f_cnt += 1 f_cnt += 1
...@@ -1004,7 +1008,7 @@ class TestLRU(unittest.TestCase): ...@@ -1004,7 +1008,7 @@ class TestLRU(unittest.TestCase):
self.assertEqual(currsize, 2) self.assertEqual(currsize, 2)
def test_lru_with_maxsize_none(self): def test_lru_with_maxsize_none(self):
@functools.lru_cache(maxsize=None) @self.module.lru_cache(maxsize=None)
def fib(n): def fib(n):
if n < 2: if n < 2:
return n return n
...@@ -1012,17 +1016,26 @@ class TestLRU(unittest.TestCase): ...@@ -1012,17 +1016,26 @@ class TestLRU(unittest.TestCase):
self.assertEqual([fib(n) for n in range(16)], self.assertEqual([fib(n) for n in range(16)],
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]) [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610])
self.assertEqual(fib.cache_info(), self.assertEqual(fib.cache_info(),
functools._CacheInfo(hits=28, misses=16, maxsize=None, currsize=16)) self.module._CacheInfo(hits=28, misses=16, maxsize=None, currsize=16))
fib.cache_clear() fib.cache_clear()
self.assertEqual(fib.cache_info(), self.assertEqual(fib.cache_info(),
functools._CacheInfo(hits=0, misses=0, maxsize=None, currsize=0)) self.module._CacheInfo(hits=0, misses=0, maxsize=None, currsize=0))
def test_lru_with_maxsize_negative(self):
@self.module.lru_cache(maxsize=-10)
def eq(n):
return n
for i in (0, 1):
self.assertEqual([eq(n) for n in range(150)], list(range(150)))
self.assertEqual(eq.cache_info(),
self.module._CacheInfo(hits=0, misses=300, maxsize=-10, currsize=1))
def test_lru_with_exceptions(self): def test_lru_with_exceptions(self):
# Verify that user_function exceptions get passed through without # Verify that user_function exceptions get passed through without
# creating a hard-to-read chained exception. # creating a hard-to-read chained exception.
# http://bugs.python.org/issue13177 # http://bugs.python.org/issue13177
for maxsize in (None, 128): for maxsize in (None, 128):
@functools.lru_cache(maxsize) @self.module.lru_cache(maxsize)
def func(i): def func(i):
return 'abc'[i] return 'abc'[i]
self.assertEqual(func(0), 'a') self.assertEqual(func(0), 'a')
...@@ -1035,7 +1048,7 @@ class TestLRU(unittest.TestCase): ...@@ -1035,7 +1048,7 @@ class TestLRU(unittest.TestCase):
def test_lru_with_types(self): def test_lru_with_types(self):
for maxsize in (None, 128): for maxsize in (None, 128):
@functools.lru_cache(maxsize=maxsize, typed=True) @self.module.lru_cache(maxsize=maxsize, typed=True)
def square(x): def square(x):
return x * x return x * x
self.assertEqual(square(3), 9) self.assertEqual(square(3), 9)
...@@ -1050,7 +1063,7 @@ class TestLRU(unittest.TestCase): ...@@ -1050,7 +1063,7 @@ class TestLRU(unittest.TestCase):
self.assertEqual(square.cache_info().misses, 4) self.assertEqual(square.cache_info().misses, 4)
def test_lru_with_keyword_args(self): def test_lru_with_keyword_args(self):
@functools.lru_cache() @self.module.lru_cache()
def fib(n): def fib(n):
if n < 2: if n < 2:
return n return n
...@@ -1060,13 +1073,13 @@ class TestLRU(unittest.TestCase): ...@@ -1060,13 +1073,13 @@ class TestLRU(unittest.TestCase):
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610] [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]
) )
self.assertEqual(fib.cache_info(), self.assertEqual(fib.cache_info(),
functools._CacheInfo(hits=28, misses=16, maxsize=128, currsize=16)) self.module._CacheInfo(hits=28, misses=16, maxsize=128, currsize=16))
fib.cache_clear() fib.cache_clear()
self.assertEqual(fib.cache_info(), self.assertEqual(fib.cache_info(),
functools._CacheInfo(hits=0, misses=0, maxsize=128, currsize=0)) self.module._CacheInfo(hits=0, misses=0, maxsize=128, currsize=0))
def test_lru_with_keyword_args_maxsize_none(self): def test_lru_with_keyword_args_maxsize_none(self):
@functools.lru_cache(maxsize=None) @self.module.lru_cache(maxsize=None)
def fib(n): def fib(n):
if n < 2: if n < 2:
return n return n
...@@ -1074,15 +1087,71 @@ class TestLRU(unittest.TestCase): ...@@ -1074,15 +1087,71 @@ class TestLRU(unittest.TestCase):
self.assertEqual([fib(n=number) for number in range(16)], self.assertEqual([fib(n=number) for number in range(16)],
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]) [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610])
self.assertEqual(fib.cache_info(), self.assertEqual(fib.cache_info(),
functools._CacheInfo(hits=28, misses=16, maxsize=None, currsize=16)) self.module._CacheInfo(hits=28, misses=16, maxsize=None, currsize=16))
fib.cache_clear() fib.cache_clear()
self.assertEqual(fib.cache_info(), self.assertEqual(fib.cache_info(),
functools._CacheInfo(hits=0, misses=0, maxsize=None, currsize=0)) self.module._CacheInfo(hits=0, misses=0, maxsize=None, currsize=0))
def test_lru_cache_decoration(self):
def f(zomg: 'zomg_annotation'):
"""f doc string"""
return 42
g = self.module.lru_cache()(f)
for attr in self.module.WRAPPER_ASSIGNMENTS:
self.assertEqual(getattr(g, attr), getattr(f, attr))
@unittest.skipUnless(threading, 'This test requires threading.')
def test_lru_cache_threaded(self):
def orig(x, y):
return 3 * x + y
f = self.module.lru_cache(maxsize=20)(orig)
hits, misses, maxsize, currsize = f.cache_info()
self.assertEqual(currsize, 0)
def full(f, *args):
for _ in range(10):
f(*args)
def clear(f):
for _ in range(10):
f.cache_clear()
orig_si = sys.getswitchinterval()
sys.setswitchinterval(1e-6)
try:
# create 5 threads in order to fill cache
threads = []
for k in range(5):
t = threading.Thread(target=full, args=[f, k, k])
t.start()
threads.append(t)
for t in threads:
t.join()
hits, misses, maxsize, currsize = f.cache_info()
self.assertEqual(hits, 45)
self.assertEqual(misses, 5)
self.assertEqual(currsize, 5)
# create 5 threads in order to fill cache and 1 to clear it
cleaner = threading.Thread(target=clear, args=[f])
cleaner.start()
threads = [cleaner]
for k in range(5):
t = threading.Thread(target=full, args=[f, k, k])
t.start()
threads.append(t)
for t in threads:
t.join()
finally:
sys.setswitchinterval(orig_si)
def test_need_for_rlock(self): def test_need_for_rlock(self):
# This will deadlock on an LRU cache that uses a regular lock # This will deadlock on an LRU cache that uses a regular lock
@functools.lru_cache(maxsize=10) @self.module.lru_cache(maxsize=10)
def test_func(x): def test_func(x):
'Used to demonstrate a reentrant lru_cache call within a single thread' 'Used to demonstrate a reentrant lru_cache call within a single thread'
return x return x
...@@ -1110,6 +1179,12 @@ class TestLRU(unittest.TestCase): ...@@ -1110,6 +1179,12 @@ class TestLRU(unittest.TestCase):
def f(): def f():
pass pass
class TestLRUC(TestLRU, unittest.TestCase):
module = c_functools
class TestLRUPy(TestLRU, unittest.TestCase):
module = py_functools
class TestSingleDispatch(unittest.TestCase): class TestSingleDispatch(unittest.TestCase):
def test_simple_overloads(self): def test_simple_overloads(self):
......
...@@ -63,6 +63,9 @@ Core and Builtins ...@@ -63,6 +63,9 @@ Core and Builtins
Library Library
------- -------
- Issue #14373: Added C implementation of functools.lru_cache(). Based on
patches by Matt Joiner and Alexey Kachayev.
- Issue 24230: The tempfile module now accepts bytes for prefix, suffix and dir - Issue 24230: The tempfile module now accepts bytes for prefix, suffix and dir
parameters and returns bytes in such situations (matching the os module APIs). parameters and returns bytes in such situations (matching the os module APIs).
......
This diff is collapsed.
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment