threadable task retry module
Project description
functastic is used to manage tasks that you would like to retry until a success condition is met. it can be run single threaded or in a separate thread. task start times, success conditions, retry attempts, retry interval, and time interval back off can be configured.
functastic provides two classes: TaskHeap and Task. Tasks wrap a function and are appended to the TaskHeap which provides a loop() function handle running/scheduling/retrying the Tasks until the success condition is met. Task's default success condition is that the function does not raise any Exception and returns a non None value.
it is important to note that a Task object can never raise an exception. calling a task either manually or using a TaskHeap will log exceptions and potentially use them to determine success, but they won’t be raised. the one exception to this rule is if your custom success_condition function raises an exception, so be careful writing them.
usage
the basic task is a wrapped function that has some attributes for determining success and when a function should be run. The configurable traits for a task include:
func, the function to be run
args, list of args to pass to the function
kwargs, dictionary of keyword args to pass to the function
attempts, number of times to retry (set to 0 means until success)
task_timeout, the number of seconds the function may be retried
delay, the time in between each run of the function (modified by backoff)
backoff, delay multiplier, extends the delay exponentially each iteration. backoff = 1 is standard interval, backoff = 2 doubles the time in between each retry
start_time, the timestamp at which the function will be run the first time ex time.time() + 30 run 30 seconds from now
success condition, function used to determine whether the task was successful this iteration. defaults to no exceptions raised and a non None return value
here are a few examples of what can be done with tasks
from functastic import Task
import time
f = some_function
# this is the basic task, some_function will be retried as quickly as possible
# until it returns a non None value and doesn't raise
task = Task(f, args['a'])
# let's give it only 10 tries
task = Task(f, args['a'], attempts=10)
# and slow it down a bit (wait 1 second between each attempt)
task = Task(f, args['a'], attempts=10, delay=1)
# and now let's make it backoff if at first it doesn't succeed
# this will be run at t=[0, 1, 2, 4, 8, 16, 32, 64, 128, 256] seconds
task = Task(f, args['a'], attempts=10, delay=1, backoff=2)
# another way to think of a task only having a certain number of attempts
# is to give it a timeout
# this function will be run every 1 second for 60 seconds
task = Task(f, args['a'], task_timeout=60, delay=1)
# want to schedule a task to start running 60 seconds from now?
# note that the task_timeout doesn't start counting until the first run
# so this function will start running in 60 seconds and retry every 1
# second for 30 seconds
task = Task(f, args['a'], start_time=time.time()+60, delay=1,
task_timeout=30))
# define your own success condition for a task
task = Task(f, args['a'], delay=1,
success_condition=lambda t: t.result == 'a')
# or change it later
task.success_condition = lambda t: t.result == 'b'
# you could also define a more involved function instead of lambdas
def success(task):
if 'some key' in task.result:
return True
task = Task(f, args['a'], delay=1, success_condition=success)
# Tasks can be used independently of a TaskHeap
task = Task(f, args['a'], attempts=10)
while task.retry:
task()
time.sleep(2)
putting it together with the TaskHeap, I’ll use a simple function that fails pretty often both with Exceptions and return values
def usually_fails(arg):
if random.randint(1, 4) != 1:
raise Exception('everything is ruined')
if random.randint(1, 4) != 2:
return None
print '%s ran at %s' % (arg, datetime.today())
return arg
run a task or set of tasks and wait for them to finish
from functastic import Task
from functastic import TaskHeap
# add tasks and then run loop(stop=True)
tasks = TaskHeap()
tasks.append(Task(usually_fails, args=['a'], delay=1))
tasks.append(Task(usually_fails, args=['b'], attempts=10, delay=1))
tasks.loop(stop=True)
run loop in another thread and add tasks willy nilly while they run
import gevent
from functastic import Task
from functastic import TaskHeap
# note the use of gevent.sleep here to specify calling gevent.sleep
# instead of time.sleep
# interval can also be passed if you don't like the default 0.01s
tasks = TaskHeap(sleep=gevent.sleep)
gevent.spawn(tasks.loop)
tasks.append(Task(usually_fails, args=['a'], delay=1))
tasks.append(Task(usually_fails, args=['b'], attempts=10, delay=1))
# have to sleep here to surrender execution to the loop's thread
while tasks:
gevent.sleep()
TaskHeap is also iterable and works as a bool and str(tasks) gives a pretty good output
from functastic import Task
from functastic import TaskHeap
tasks = TaskHeap()
tasks.append(Task(usually_fails, args=['a'], delay=1))
tasks.append(Task(usually_fails, args=['b'], attempts=10, delay=1))
if tasks:
print len(tasks)
print str(tasks)
for task in tasks:
print task
install
pip install functastic or clone the repo and python setup.py install or pip install -e ./
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
File details
Details for the file functastic-1.0.1.tar.gz
.
File metadata
- Download URL: functastic-1.0.1.tar.gz
- Upload date:
- Size: 9.3 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 53fa5ccc46ac571c646b41f842a463cf9f19a037b952d4619ccaa328e6f8f0e4 |
|
MD5 | 9975a4715250b39da6b25042d4564a78 |
|
BLAKE2b-256 | feac6dd75207fe23e1d163066417a1c884da9c8ced91f77ebd06443edcf55729 |