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.
1 maintainer
Release files for cs.later 20160828
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| cs.later-20160828.tar.gz | 13.3 kB | Details |
Release files / cs.later-20160828.tar.gz
| Download URL | cs.later-20160828.tar.gz |
|---|---|
| Size | 13.3 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
bda6b523ddc5a7b8ab5b10db5f34783b831e941cde74f5d19bb7301fdd505f15
|
|
BLAKE2b-256 checksum How to use checksums |
069e52f9018f14b194f374a5b12178cb99116870fbb0cce5670f73e61170ace8
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
