/g " d Z ddlZddlZddlmZ ddlmZ ddlZddlmZ dgZ
edd Z d e j _ d
e j _ d e j
_ d e j _ d
e j _ de j _ e Z G d d ZdS )a 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).
N)
namedtuple)count) monotonic schedulerEventz2time, priority, sequence, action, argument, kwargszaNumeric type compatible with the return value of the
timefunc function passed to the constructor.zSEvents scheduled for the same time will be executed
in the order of their priority.zbA continually increasing sequence number that
separates events if time and priority are equal.z?Executing the event means executing
action(*argument, **kwargs)zGargument is a sequence holding the positional
arguments for the action.zDkwargs is a dictionary holding the keyword
arguments for the action.c f e Zd Zeej fdZdefdZdefdZ d Z
d Z d dZ e
d Zd
S ) r c g | _ t j | _ || _ || _ t
| _ dS )zGInitialize a new instance, passing the time and delay
functionsN)_queue threadingRLock_locktimefunc delayfuncr _sequence_generator)selfr r s ,/opt/alt/python311/lib64/python3.11/sched.py__init__zscheduler.__init__5 s: _&&
"#(77 c |t u ri }| j 5 t ||t | j ||| }t j | j | ddd n # 1 swxY w Y |S )zEnter 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) _sentinelr
r nextr heapqheappushr
)r timepriorityactionargumentkwargsevents r enterabszscheduler.enterabs> s Y F
Z / /$$t/G*H*H (F4 4E N4; . . . / / / / / / / / / / / / / / / s AA A$'A$c b | |z }| ||||| S )z{A variant that specifies the time as a relative time.
This is actually the more commonly used interface.
)r r! )r delayr r r r r s r enterzscheduler.enterN s0 }}&}}T8VXvFFFr c | j 5 | j | t j | j ddd dS # 1 swxY w Y dS )zRemove 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)r
r
remover heapify)r r s r cancelzscheduler.cancelW s Z ' ' K u % % % M$+ & & & ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' 's 4A A
A
c T | j 5 | j cddd S # 1 swxY w Y dS )z!Check whether the queue is empty.N)r
r
)r s r emptyzscheduler.emptyb su
Z # #{? # # # # # # # # # # # # # # # # # #s !!Tc ^ | j }| j }| j }| j }t j } |5 |s ddd dS |d \ }}} }
} } | }
||
k rd}n
d} || ddd n # 1 swxY w Y |r|s||
z
S |||
z
n |
| i | |d )a 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.
TNr F)r
r
r r r heappop)r blockinglockqr r popr r sequencer r r nowr# s r runz
scheduler.rung s\ 4 z KN =m
&'qT#x66 hjj#:: EE !ECFFF
& #:% $*%%%%+F+++ ! % s A8/A88A<?A<c | j 5 | j dd }ddd n # 1 swxY w Y t t t j |gt
| z S )zAn ordered list of upcoming events.
Events are named tuples with fields for:
time, priority, action, arguments, kwargs
N)r
r
listmapr r, len)r eventss r queuezscheduler.queue s Z $ $[^F $ $ $ $ $ $ $ $ $ $ $ $ $ $ $C
xF ';<<===s $((N)T)__name__
__module__ __qualname___timer sleepr r r! r$ r( r* r3 propertyr9 r r r r r 3 s % + + + + 9;9 79 G G G G ' ' '# # #
1 1 1 1 f > > X > > >r )__doc__r r collectionsr itertoolsr r r r= __all__r r r1 r r r objectr r r r r