cs.later

I use Later objects for convenient queuing of functions whose execution occurs later in a priority order with capacity constraints.

Why not futures? I already had this, I prefer its naming scheme and interface, and futures did not seem to support prioritising execution.

Use is simple enough: create a Later instance and typically queue functions with the .defer() method:

L = Later(4)      # a Later with a parallelism of 4
...
LF = L.defer(func, *args, **kwargs)
...
x = LF()          # collect result

The .defer method and its sublings return a LateFunction, which is a subclass of cs.asynchron.Asynchron. As such it is a callable, so to collect the result you just call the LateFunction.

Release files for cs.later 20150115

For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.

Source distribution (sdist)

Source distribution for cs.later 20150115
File	Size	Uploaded
cs.later-20150115.tar.gz	11.6 kB	Jan 18, 2015	Details

Release files / cs.later-20150115.tar.gz

Download URL	cs.later-20150115.tar.gz
Size	11.6 kB
Tags	Source
SHA-256 checksum How to use checksums	`e148c6c57753733a8c31b991910c5d8754e9127494d48deacefb5fb47be3a3d9`
BLAKE2b-256 checksum How to use checksums	`cd50b83712eab7c82583f8edf0cf1cfb663b8ec27704853374bb336f21beebb8`
Upload date	Jan 18, 2015
Uploaded using Trusted Publishing? What is trusted publishing?	No