-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtail_rec.py
More file actions
63 lines (52 loc) · 1.45 KB
/
tail_rec.py
File metadata and controls
63 lines (52 loc) · 1.45 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
import threading
class tail_rec_exec(tuple): pass
class tail_rec:
def __init__(self, func):
self.func = func
def call(self, *args, **kwargs):
return tail_rec_exec((self.func, args, kwargs))
def __call__(self, *args, **kwargs):
r = self.func(*args, **kwargs)
while isinstance(r, tail_rec_exec):
func, args, kwargs = r
r = func(*args, **kwargs)
return r
class smart_tail_rec(tail_rec):
data = threading.local()
data.calling = False
def __call__(self, *args, **kwargs):
if self.data.calling:
return self.call(*args, **kwargs)
try:
self.data.calling = True
return super().__call__(*args, **kwargs)
finally:
self.data.calling = False
if __name__ == '__main__':
@tail_rec
def my_sum(values, acc=0):
if not values:
return acc
return my_sum.call(values[1:], acc + values[0])
@smart_tail_rec
def factorial(n, acc=1):
if not n:
return acc
return factorial(n - 1, acc * n)
@smart_tail_rec
def even(n):
if not n:
return True
return odd(n - 1)
@smart_tail_rec
def odd(n):
if not n:
return False
return even(n - 1)
print(my_sum(range(5000)))
print(factorial(5000))
print(factorial(5))
print(even(5000))
print(odd(5000))
print(even(5001))
print(odd(5001))