Metadata-Version: 1.1
Name: cs.later
Version: 20160828
Summary: queue functions for execution later
Home-page: https://bitbucket.org/cameron_simpson/css/commits/all
Author: Cameron Simpson
Author-email: cs@zip.com.au
License: UNKNOWN
Description: Later: queue functions for execution later in priority and time order.
        ======================================================================
        
        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.
        
Keywords: python2,python3
Platform: UNKNOWN
Classifier: Programming Language :: Python
Classifier: Programming Language :: Python :: 2
Classifier: Programming Language :: Python :: 3
Classifier: Topic :: Software Development :: Libraries :: Python Modules
Classifier: Intended Audience :: Developers
Classifier: Development Status :: 4 - Beta
Classifier: Operating System :: OS Independent
Classifier: License :: OSI Approved :: GNU General Public License v3 (GPLv3)
