Advanced Web Server Manager
Complete File Manager & Terminal - Standalone Version
By Sid Gifari | Gifari Industries
Current path:
/
/
opt
/
alt
/
python33
/
lib64
/
python3.3
/
__pycache__
✏️
Editing: sched.cpython-33.pyo
� �� f� c @ s� d Z d d l Z d d l Z d d l m Z y d d l Z Wn e k r^ d d l Z Yn Xy d d l m Z Wn" e k r� d d l m Z Yn Xd g Z Gd d � d e d d � � Z e � Z Gd d � d � Z d S( u� A generally useful event scheduler class. Each instance of this class manages its own queue. No multi-threading is implied; you are supposed to hack that yourself, or use a single instance per application. Each instance is parametrized with two functions, one that is supposed to return the current time, one that is supposed to implement a delay. You can implement real-time scheduling by substituting time and sleep from built-in module time, or you can implement simulated time by writing your own functions. This can also be used to integrate scheduling with STDWIN events; the delay function is allowed to modify the queue. Time can be expressed as integers or floating point numbers, as long as it is consistent. Events are specified by tuples (time, priority, action, argument, kwargs). As in UNIX, lower priority numbers mean higher priority; in this way the queue can be maintained as a priority queue. Execution of the event means calling the action function, passing it the argument sequence in "argument" (remember that in Python, multiple function arguments are be packed in a sequence) and keyword parameters in "kwargs". The action function may be an instance method so it has another way to reference private data (besides global variables). i N( u namedtuple( u monotonic( u timeu schedulerc B s\ | Ee Z d Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d S( u Eventc C s" | j | j f | j | j f k S( N( u timeu priority( u su o( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu __eq__. s u Event.__eq__c C s" | j | j f | j | j f k S( N( u timeu priority( u su o( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu __ne__/ s u Event.__ne__c C s" | j | j f | j | j f k S( N( u timeu priority( u su o( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu __lt__0 s u Event.__lt__c C s" | j | j f | j | j f k S( N( u timeu priority( u su o( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu __le__1 s u Event.__le__c C s" | j | j f | j | j f k S( N( u timeu priority( u su o( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu __gt__2 s u Event.__gt__c C s" | j | j f | j | j f k S( N( u timeu priority( u su o( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu __ge__3 s u Event.__ge__N( u __name__u __module__u __qualname__u __eq__u __ne__u __lt__u __le__u __gt__u __ge__( u __locals__( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu Event- s u Eventu( time, priority, action, argument, kwargsc B s� | Ee Z d Z e e j d d � Z f e d d � Z f e d d � Z d d � Z d d � Z d d d � Z e d d � � Z d S( u schedulerc C s. g | _ t j � | _ | | _ | | _ d S( uG Initialize a new instance, passing the time and delay functionsN( u _queueu threadingu RLocku _locku timefuncu delayfunc( u selfu timefuncu delayfunc( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu __init__9 s u scheduler.__init__c C sX | t k r i } n | j �4 t | | | | | � } t j | j | � | SWd QXd S( u� Enter a new event in the queue at an absolute time. Returns an ID for the event which can be used to remove it, if necessary. N( u _sentinelu _locku Eventu heapqu heappushu _queue( u selfu timeu priorityu actionu argumentu kwargsu event( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu enterabsA s u scheduler.enterabsc C s= | j �. | j � | } | j | | | | | � SWd QXd S( u{ A variant that specifies the time as a relative time. This is actually the more commonly used interface. N( u _locku timefuncu enterabs( u selfu delayu priorityu actionu argumentu kwargsu time( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu enterO s u scheduler.enterc C s4 | j �% | j j | � t j | j � Wd QXd S( u� Remove an event from the queue. This must be presented the ID as returned by enter(). If the event is not in the queue, this raises ValueError. N( u _locku _queueu removeu heapqu heapify( u selfu event( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu cancelY s u scheduler.cancelc C s | j � | j SWd QXd S( u! Check whether the queue is empty.N( u _locku _queue( u self( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu emptyd s u scheduler.emptyc C s� | j } | j } | j } | j } t j } x� | �V | sA Pn | d \ } } } } } | � } | | k rx d } n d } | | � Wd QX| r� | s� | | S| | | � q0 | | | � | d � q0 d S( u Execute events until the queue is empty. If blocking is False executes the scheduled events due to expire soonest (if any) and then return the deadline of the next scheduled call in the scheduler. When there is a positive delay until the first event, the delay function is called and the event is left in the queue; otherwise, the event is removed from the queue and executed (its action function is called, passing it the argument). If the delay function returns prematurely, it is simply restarted. It is legal for both the delay function and the action function to modify the queue or to raise an exception; exceptions are not caught but the scheduler's state remains well-defined so run() may be called again. A questionable hack is added to allow other threads to run: just after an event is executed, a delay of 0 is executed, to avoid monopolizing the CPU when other threads are also runnable. i NTF( u _locku _queueu delayfuncu timefuncu heapqu heappopu Trueu False( u selfu blockingu locku qu delayfuncu timefuncu popu timeu priorityu actionu argumentu kwargsu nowu delay( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu runi s* u scheduler.runc C sJ | j �; | j d d � } t t t j | g t | � � � SWd QXd S( u� An ordered list of upcoming events. Events are named tuples with fields for: time, priority, action, arguments, kwargs N( u _locku _queueu listu mapu heapqu heappopu len( u selfu events( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu queue� s u scheduler.queueNT( u __name__u __module__u __qualname__u _timeu timeu sleepu __init__u _sentinelu enterabsu enteru cancelu emptyu Trueu runu propertyu queue( u __locals__( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu scheduler7 s 2( u __doc__u timeu heapqu collectionsu namedtupleu threadingu ImportErroru dummy_threadingu monotonicu _timeu __all__u Eventu objectu _sentinelu scheduler( ( ( u* /opt/alt/python33/lib64/python3.3/sched.pyu <module> s
💾 Save Changes
❌ Cancel