Tail recursion with a simple decorator api.
Project description
Installation
pip install tail-recursive
Basic Usage
Use the tail_recursive
decorator to simply define tail recursive functions.
If you are encountering maximum recursion depth errors or out-of-memory crashes tail recursion can be a helpful strategy.
Example
from tail_recursive import tail_recursive
# Pick a larger value if n is below your system's recursion limit.
x = 5000
def factorial_without_tail_recursion(n):
if n <= 1:
return n
return n * factorial_without_tail_recursion(n - 1)
try:
# This will exceed the maximum recursion depth.
factorial_without_tail_recursion(x)
except RecursionError:
pass
@tail_recursive
def factorial(n):
if n <= 1:
return n
# It is important that you return the return value of the `tail_call`
# method for tail recursion to take effect!
# Note tail calls work with dunder methods, such as __mul__ and __rmul__,
# by default.
return n * factorial.tail_call(n - 1)
# Implementation with tail recursion succeeds because the function is
# called sequentially under the hood.
factorial(x)
Features
Feature Sets
Three feature sets are currently supported:
FeatureSet.BASE
, FeatureSet.NESTED_CALLS
and FeatureSet.FULL
.
Where the "base" feature set provides a subset of the functionality of the "nested_calls" feature set which provides
a subset of the "full" functionality.
As a result the following python code is valid:
from tail_recursive import FeatureSet
assert FeatureSet.FULL == FeatureSet.FULL | FeatureSet.NESTED_CALLS == FeatureSet.FULL | FeatureSet.NESTED_CALLS | FeatureSet.BASE
The default feature set is "full". Choosing a feature set with less functionality will provide some performance increase.
The desired feature set can be set be passing a value to the feature_set
parameter, e.g.:
@tail_recursive(feature_set=FeatureSet.NESTED_CALLS)
def func(...):
...
You can also pass a lowercase string as a shorthand, e.g.:
@tail_recursive(feature_set="nested_calls")
def func(...):
...
Nested Calls (feature_set="nested_calls"/FeatureSet.NESTED_CALLS | "full"/FeatureSet.FULL
)
This feature will resolve tail calls passed as parameters to other tail calls.
...
@tail_recursive
def mul(a, b):
return a * b
@tail_recursive
def factorial(n):
if n == 1:
return n
return mul.tail_call(n, factorial.tail_call(n - 1))
...
As mentioned this comes at a performance cost and can be disabled by using the "base" feature set.
Method Calls (feature_set="full"/FeatureSet.Full
)
Method calls on tail calls are supported, e.g.:
@tail_recursive(feature_set=feature_set)
def func(n):
if n == 0:
return set()
return func.tail_call(n - 1).union({n})
Operator Overloading and Dunder Method Overriding (feature_set="full"/FeatureSet.Full
)
n * factorial.tail_call(n - 1)
shows that numeric operations
can be done on tail calls, so long as the result of the expression
is returned by the function. These expressions will ultimately
evaluate to the same value that they would have if tail_call
had been omitted.
This is also true for comparison and bitwise
operations, attribute and index access (i.e. <func>.tail_call(...)[...]
)
and much more functionality provided by dunder methods.
That being said, attribute assignment (i.e. <func>.tail_call(...).<attr> = val
)
and the functionality provided by the following dunder methods are not currently
supported with tail_call
.
__del__
__getattribute__
__setattr__
__get__
__set__
__delete__
__set_name__
__init_subclass__
__prepare__
Note that also __init__
and __new__
cannot be called directly on a tail call
(e.g. <func>.tail_call(...).__init__(...)
) and are instead implicitly lazily evaluated
with the arguments passed to tail_call
while popping off/unwinding the tail call stack.
Futhermore, dunder methods added after 3.8 and in standard library or third-party packages/modules may also not be supported.
Another important note is that dunder attributes will currently not be lazily evaluated. e.g.
__doc__
__name__
__qualname__
__module__
__defaults__
__defaults__
__code__
__globals__
__dict__
__closure__
__annotations__
__kwdefaults__
Finally, since __repr__
and __str__
are overridden use
<func>.tail_call(...)._to_string()
to pretty print tail calls.
Usage with other Decorators
Especially in recursive algorithms it can significantly increase performance
to use memoization. In this use case it is best to place the decorator enabling
memoization after @tail_recursive
. e.g.
import functools
@tail_recursive(feature_set="full")
@functools.lru_cache
def fibonacci(n):
if n <= 1:
return n
return fibonacci.tail_call(n - 1) + fibonacci.tail_call(n - 2)
For properties place the @property
decorator before @tail_recursive
.
Current Limitations
Return Values
Currently, tail calls that are returned as item/member in a tuple or other data structures are not evaluated.
The following will not evaluate the tail call.
from tail_recursive import tail_recursive
@tail_recursive
def func(...):
...
return return_val1, func.tail_call(...)
A workaround is to use factory functions.
from tail_recursive import tail_recursive
@tail_recursive
def tuple_factory(*args):
return tuple(args)
@tail_recursive
def func(...):
...
return tuple_factory.tail_call(
return_val1,
func.tail_call(...)
)
Or pass the container object's type directly to tail_recursive
.
from tail_recursive import tail_recursive
@tail_recursive
def func(...):
...
return tail_recursive(tuple).tail_call((
return_val1,
func.tail_call(...)
))
Method Decorators
Currently, when calling tail_call
on a decorated method, you need to explicitly pass
self (the current objects instance) as the first argument. e.g.
class MathStuff:
@tail_recursive(feature_set="full")
def fibonacci(self, n):
if n <= 1:
return n
return self.fibonacci.tail_call(self, n - 1) + self.fibonacci.tail_call(self, n - 2)
^^^^ ^^^^
How it works
@tail_recursive
def factorial(n):
if n <= 1:
return n
return n * factorial.tail_call(n - 1)
When a function (in this case factorial
) is decorated by @tail_recursive
, it returns
an object implementing the tail_call
method. This object also overrides the __call__
method, meaning that it can be called just like the original function (e.g. factorial(x)
).
Decorated functions test whether they return a call to tail_call(...)
. If this is the case
then the return value is pushed on a call stack implemented as a list. tail_call
returns
an object storing the function it was called on (e.g. factorial
) and the (keyword)
arguments (e.g. n - 1
) it was called with. If the arguments contain a nested call to tail_call
then this
call is also pushed onto the call stack. On the other hand if tail_call
is passed no nested
tail_call
s then the function that it stores is called with the stored (keyword) arguments. The
return value of this lazy call then (a) replaces the argument it was passed as or (b)
returns another tail_call
which is pushed to the stack or (c) is the final return value of
the call to the decorated function (e.g. factorial(x)
).
But how can factorial.tail_call(n - 1)
be multiplied by n
? Well, the object returned by
tail_call
overrides most dunder methods, such as __mul__
and __rmul__
, pushing the
equivalent of tail_recursive(int.__rmul__).tail_call(n, factorial.tail_call(n - 1)
to the
call stack.
The call stack for factorial(3)
would looks something like this.
- Because
factorial(3)
is called,<lazy_call_obj>(func=factorial, args=(3,), kwargs={})
is pushed on the stack.
[
<lazy_call_obj>(func=factorial, args=(3,), kwargs={}),
]
- Because
<lazy_call_obj>(func=factorial, args=(3,), kwargs={})
contains no nested arguments, it is popped off the stack. It is then lazily evaluated, returning another<lazy_call_obj>
, which is pushed to the stack.
[
<lazy_call_obj>(func=int.__rmul__, args(<lazy_call_obj>(func=factorial, args=(2,), kwargs={}), 3), kwargs={}),
]
- The lazy call to
__rmul__
has a nested call as an argument. Consequentially, this argument is pushed on the call stack.
[
<lazy_call_obj>(func=int.__rmul__, args=(<lazy_call_obj>(func=factorial, args=(2,), kwargs={}), 3), kwargs={}),
<lazy_call_obj>(func=factorial, args=(2,), kwargs={}),
]
- As in step 2 the lazy call to
factorial(2)
is pop off the stack and its return value is pushed on.
[
<lazy_call_obj>(func=int.__rmul__, args=(<lazy_call_obj>(func=factorial, args=(2,), kwargs={}), 3), kwargs={}),
<lazy_call_obj>(func=int.__rmul__, args=(<lazy_call_obj>(func=factorial, args=(1,), kwargs={}), 2), kwargs={}),
]
- Similarly to step 3, because the lazy call to
__rmul__
has a nested call as an argument, this argument is pushed on the stack.
[
<lazy_call_obj>(func=int.__rmul__, args=(<lazy_call_obj>(func=factorial, args=(2,), kwargs={}), 3), kwargs={}),
<lazy_call_obj>(func=int.__rmul__, args=(<lazy_call_obj>(func=factorial, args=(1,), kwargs={}), 2), kwargs={}),
<lazy_call_obj>(func=factorial, args=(1,), kwargs={}),
]
<lazy_call_obj>(func=int.__rmul__, args=(1,), kwargs={})
has no nested lazy calls as arguments, so it is popped off the stack and its return value replaces the argument of__rmul__
that it was originally passed as.
[
<lazy_call_obj>(func=int.__rmul__, args=(<lazy_call_obj>(func=factorial, args=(2,), kwargs={}), 3), kwargs={}),
<lazy_call_obj>(func=int.__rmul__, args=(1, 2), kwargs={}),
]
- The same process as in 6 is repeated, where
<lazy_call_obj>(func=int.__rmul__, args=(2, 1), kwargs={})
is popped off the stack and its return value replaces the second argument of the lazy call toint.__rmul__(3, ...)
.
[
<lazy_call_obj>(func=int.__rmul__, args=(2, 3), kwargs={}),
]
- Finally, because the lazy call to
__rmul__
no longer has any nested calls as arguments, it can be popped off the stack. Furthermore, it was not passed as an argument of a previous call on the stack and, for that reason, is returned from our decorated function (i.e.factorial(3) = int.__rmul__(2, 3) = 6
).
[]
Other Packages
Check out tco for an alternative api with extra functionality.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
File details
Details for the file tail-recursive-2.1.0.tar.gz
.
File metadata
- Download URL: tail-recursive-2.1.0.tar.gz
- Upload date:
- Size: 10.4 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: poetry/1.1.12 CPython/3.10.1 Darwin/20.6.0
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | b2cba5019202154d5d4a9b1afb0f7317e760052750c30de0289cc0bea104daa6 |
|
MD5 | 6cefe78f1c22b69d7d19d14ff8b4aa68 |
|
BLAKE2b-256 | 1eb0d9fa7fe837310398d62c42178ad2bd10c1c4f08b163c71769a5fd26d36d4 |
File details
Details for the file tail_recursive-2.1.0-py3-none-any.whl
.
File metadata
- Download URL: tail_recursive-2.1.0-py3-none-any.whl
- Upload date:
- Size: 9.0 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: poetry/1.1.12 CPython/3.10.1 Darwin/20.6.0
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 63e0344bf01385ff1336c92e7788ff8ced55ac9211f57bf1daf67181298c95fb |
|
MD5 | 1fabb95439a4137c92f67d9695883a44 |
|
BLAKE2b-256 | eca791a508cb7b2cb852df27b0f387c9501c29944a1cce875d0bfc4a914b5112 |