Current File : //opt/rh/rh-python35/root/lib64/python3.5/__pycache__/threading.cpython-35.opt-1.pyc
���\� � @ sU d Z d d l Z d d l Z d d l m Z d d l m Z d d l
m Z d d l m
Z m Z y d d l m Z Wn" e k
r� d d l m Z Yn Xd d d
d d d
d d d d d d d d d d d g Z e j Z e j Z e j Z e j Z e j Z y
e j Z Wn e! k
r*d Z Yn Xe j" Z" [ d a# d a$ d d � Z% d d � Z& e Z' d d � Z Gd d � d � Z( e( Z) Gd d � d � Z* Gd d � d � Z+ Gd d � d e+ � Z, Gd! d � d � Z- Gd" d � d � Z. Gd# d$ � d$ e/ � Z0 e � j1 Z2 e2 � d% d& d' � Z3 e � a4 i Z5 i Z6 e � Z7 Gd( d � d � Z8 Gd) d � d e8 � Z9 Gd* d+ � d+ e8 � Z: Gd, d- � d- e8 � Z; d. d
� Z< e< Z= d/ d � Z> e> Z? d0 d1 � Z@ d2 d � ZA d d3 l mB ZB e: � aC d4 d5 � ZD d6 d7 � ZE d8 d9 � ZF y d d: l mG ZH Wn" e k
rDd d; lI mH ZH Yn Xd< d= � ZJ d S)>z;Thread module emulating a subset of Java's threading model.� N)� monotonic)�
format_exc)�WeakSet)�islice�count)�deque� active_count� Condition�current_thread� enumerate�Event�Lock�RLock� Semaphore�BoundedSemaphore�Thread�Barrier�Timer� ThreadError�
setprofile�settrace�local�
stack_sizec C s
| a d S)z�Set a profile function for all threads started from the threading module.
The func will be passed to sys.setprofile() for each thread, before its
run() method is called.
N)�
_profile_hook)�func� r �9/opt/rh/rh-python35/root/usr/lib64/python3.5/threading.pyr 0 s c C s
| a d S)z�Set a trace function for all threads started from the threading module.
The func will be passed to sys.settrace() for each thread, before its run()
method is called.
N)� _trace_hook)r r r r r : s c O s& t d k r t | | � St | | � S)a2 Factory function that returns a new reentrant lock.
A reentrant lock must be released by the thread that acquired it. Once a
thread has acquired a reentrant lock, the same thread may acquire it again
without blocking; the thread must release it once for each time it has
acquired it.
N)�_CRLock�_PyRLock)�args�kwargsr r r r H s
c @ s� e Z d Z d Z d d � Z d d � Z d d d d � Z e Z d
d � Z d d
� Z d d � Z
d d � Z d d � Z d S)�_RLocka, This class implements reentrant lock objects.
A reentrant lock must be released by the thread that acquired it. Once a
thread has acquired a reentrant lock, the same thread may acquire it
again without blocking; the thread must release it once for each time it
has acquired it.
c C s" t � | _ d | _ d | _ d S)Nr )�_allocate_lock�_block�_owner�_count)�selfr r r �__init___ s z_RLock.__init__c C sy | j } y t | j } Wn t k
r. Yn Xd | j j � rG d n d | j j | j j | | j t
t | � � f S)Nz)<%s %s.%s object owner=%r count=%d at %s>�lockedZunlocked) r% �_active�name�KeyErrorr$ r) � __class__�
__module__� __qualname__r& �hex�id)r' �ownerr r r �__repr__d s
z_RLock.__repr__T� c C s\ t � } | j | k r+ | j d 7_ d S| j j | | � } | rX | | _ d | _ | S)a Acquire a lock, blocking or non-blocking.
When invoked without arguments: if this thread already owns the lock,
increment the recursion level by one, and return immediately. Otherwise,
if another thread owns the lock, block until the lock is unlocked. Once
the lock is unlocked (not owned by any thread), then grab ownership, set
the recursion level to one, and return. If more than one thread is
blocked waiting until the lock is unlocked, only one at a time will be
able to grab ownership of the lock. There is no return value in this
case.
When invoked with the blocking argument set to true, do the same thing
as when called without arguments, and return true.
When invoked with the blocking argument set to false, do not block. If a
call without an argument would block, return false immediately;
otherwise, do the same thing as when called without arguments, and
return true.
When invoked with the floating-point timeout argument set to a positive
value, block for at most the number of seconds specified by timeout
and as long as the lock cannot be acquired. Return true if the lock has
been acquired, false if the timeout has elapsed.
r4 )� get_identr% r& r$ �acquire)r' �blocking�timeout�me�rcr r r r6 s s z_RLock.acquirec C sR | j t � k r t d � � | j d | _ } | sN d | _ | j j � d S)am Release a lock, decrementing the recursion level.
If after the decrement it is zero, reset the lock to unlocked (not owned
by any thread), and if any other threads are blocked waiting for the
lock to become unlocked, allow exactly one of them to proceed. If after
the decrement the recursion level is still nonzero, the lock remains
locked and owned by the calling thread.
Only call this method when the calling thread owns the lock. A
RuntimeError is raised if this method is called when the lock is
unlocked.
There is no return value.
z cannot release un-acquired lockr4 N)r% r5 � RuntimeErrorr& r$ �release)r' r r r r r< � s z_RLock.releasec C s | j � d S)N)r< )r' �t�v�tbr r r �__exit__� s z_RLock.__exit__c C s# | j j � | \ | _ | _ d S)N)r$ r6 r& r% )r' �stater r r �_acquire_restore� s
z_RLock._acquire_restorec C sV | j d k r t d � � | j } d | _ | j } d | _ | j j � | | f S)Nr z cannot release un-acquired lock)r& r; r% r$ r< )r' r r2 r r r �
_release_save� s
z_RLock._release_savec C s | j t � k S)N)r% r5 )r' r r r � _is_owned� s z_RLock._is_ownedN���)
�__name__r. r/ �__doc__r( r3 r6 � __enter__r< r@ rB rC rD r r r r r" U s $
r" c @ s� e Z d Z d Z d d d � Z d d � Z d d � Z d d
� Z d d � Z d
d � Z d d � Z
d d d � Z d d d � Z d d d � Z
d d � Z e Z d S)r aj Class that implements a condition variable.
A condition variable allows one or more threads to wait until they are
notified by another thread.
If the lock argument is given and not None, it must be a Lock or RLock
object, and it is used as the underlying lock. Otherwise, a new RLock object
is created and used as the underlying lock.
Nc C s� | d k r t � } | | _ | j | _ | j | _ y | j | _ Wn t k
rZ Yn Xy | j | _ Wn t k
r Yn Xy | j | _ Wn t k
r� Yn Xt � | _ d S)N)
r �_lockr6 r< rC �AttributeErrorrB rD �_deque�_waiters)r' �lockr r r r( � s$
zCondition.__init__c C s
| j j � S)N)rI rH )r' r r r rH � s zCondition.__enter__c G s | j j | � S)N)rI r@ )r' r r r r r@ � s zCondition.__exit__c C s d | j t | j � f S)Nz<Condition(%s, %d)>)rI �lenrL )r' r r r r3 � s zCondition.__repr__c C s | j j � d S)N)rI r< )r' r r r rC � s zCondition._release_savec C s | j j � d S)N)rI r6 )r' �xr r r rB � s zCondition._acquire_restorec C s+ | j j d � r# | j j � d Sd Sd S)Nr FT)rI r6 r< )r' r r r rD � s
zCondition._is_ownedc C s� | j � s t d � � t � } | j � | j j | � | j � } d } zW | d k ro | j � d } n0 | d k r� | j d | � } n | j d � } | SWd | j | � | s� y | j j | � Wn t k
r� Yn XXd S)ak Wait until notified or until a timeout occurs.
If the calling thread has not acquired the lock when this method is
called, a RuntimeError is raised.
This method releases the underlying lock, and then blocks until it is
awakened by a notify() or notify_all() call for the same condition
variable in another thread, or until the optional timeout occurs. Once
awakened or timed out, it re-acquires the lock and returns.
When the timeout argument is present and not None, it should be a
floating point number specifying a timeout for the operation in seconds
(or fractions thereof).
When the underlying lock is an RLock, it is not released using its
release() method, since this may not actually unlock the lock when it
was acquired multiple times recursively. Instead, an internal interface
of the RLock class is used, which really unlocks it even when it has
been recursively acquired several times. Another internal interface is
then used to restore the recursion level when the lock is reacquired.
z cannot wait on un-acquired lockFNTr )
rD r; r# r6 rL �appendrC rB �remove�
ValueError)r' r8 �waiterZ saved_stateZgotitr r r �wait s*
zCondition.waitc C s~ d } | } | � } xb | sy | d k r` | d k rF t � | } n | t � } | d k r` P| j | � | � } q W| S)z�Wait until a condition evaluates to True.
predicate should be a callable which result will be interpreted as a
boolean value. A timeout may be provided giving the maximum time to
wait.
Nr )�_timerT )r' Z predicater8 �endtimeZwaittime�resultr r r �wait_for5 s
zCondition.wait_forr4 c C s� | j � s t d � � | j } t t | | � � } | s@ d Sx> | D]6 } | j � y | j | � WqG t k
r| YqG XqG Wd S)aK Wake up one or more threads waiting on this condition, if any.
If the calling thread has not acquired the lock when this method is
called, a RuntimeError is raised.
This method wakes up at most n of the threads waiting for the condition
variable; it is a no-op if no threads are waiting.
z!cannot notify on un-acquired lockN)rD r; rL rK �_islicer< rQ rR )r' �nZ all_waitersZwaiters_to_notifyrS r r r �notifyL s
zCondition.notifyc C s | j t | j � � d S)z�Wake up all threads waiting on this condition.
If the calling thread has not acquired the lock when this method
is called, a RuntimeError is raised.
N)r[ rN rL )r' r r r �
notify_allc s zCondition.notify_all)rF r. r/ rG r( rH r@ r3 rC rB rD rT rX r[ r\ Z notifyAllr r r r r � s
0 c @ sU e Z d Z d Z d d d � Z d d d d � Z e Z d d
� Z d d � Z d S)
r aG This class implements semaphore objects.
Semaphores manage a counter representing the number of release() calls minus
the number of acquire() calls, plus an initial value. The acquire() method
blocks if necessary until it can return without making the counter
negative. If not given, value defaults to 1.
r4 c C s7 | d k r t d � � t t � � | _ | | _ d S)Nr z$semaphore initial value must be >= 0)rR r r
�_cond�_value)r' �valuer r r r( { s zSemaphore.__init__TNc
C s� | r | d k r t d � � d } d } | j �� x� | j d k r� | sN P| d k r� | d k rv t � | } n | t � } | d k r� P| j j | � q8 W| j d 8_ d } Wd QRX| S)a� Acquire a semaphore, decrementing the internal counter by one.
When invoked without arguments: if the internal counter is larger than
zero on entry, decrement it by one and return immediately. If it is zero
on entry, block, waiting until some other thread has called release() to
make it larger than zero. This is done with proper interlocking so that
if multiple acquire() calls are blocked, release() will wake exactly one
of them up. The implementation may pick one at random, so the order in
which blocked threads are awakened should not be relied on. There is no
return value in this case.
When invoked with blocking set to true, do the same thing as when called
without arguments, and return true.
When invoked with blocking set to false, do not block. If a call without
an argument would block, return false immediately; otherwise, do the
same thing as when called without arguments, and return true.
When invoked with a timeout other than None, it will block for at
most timeout seconds. If acquire does not complete successfully in
that interval, return false. Return true otherwise.
Nz.can't specify timeout for non-blocking acquireFr r4 T)rR r] r^ rU rT )r' r7 r8 r: rV r r r r6 � s$
zSemaphore.acquirec
C s1 | j �! | j d 7_ | j j � Wd QRXd S)z�Release a semaphore, incrementing the internal counter by one.
When the counter is zero on entry and another thread is waiting for it
to become larger than zero again, wake up that thread.
r4 N)r] r^ r[ )r' r r r r< � s
zSemaphore.releasec C s | j � d S)N)r< )r' r= r> r? r r r r@ � s zSemaphore.__exit__) rF r. r/ rG r( r6 rH r< r@ r r r r r o s - c @ s1 e Z d Z d Z d d d � Z d d � Z d S)r a� Implements a bounded semaphore.
A bounded semaphore checks to make sure its current value doesn't exceed its
initial value. If it does, ValueError is raised. In most situations
semaphores are used to guard resources with limited capacity.
If the semaphore is released too many times it's a sign of a bug. If not
given, value defaults to 1.
Like regular semaphores, bounded semaphores manage a counter representing
the number of release() calls minus the number of acquire() calls, plus an
initial value. The acquire() method blocks if necessary until it can return
without making the counter negative. If not given, value defaults to 1.
r4 c C s t j | | � | | _ d S)N)r r( �_initial_value)r' r_ r r r r( � s zBoundedSemaphore.__init__c
C sO | j �? | j | j k r( t d � � | j d 7_ | j j � Wd QRXd S)a6 Release a semaphore, incrementing the internal counter by one.
When the counter is zero on entry and another thread is waiting for it
to become larger than zero again, wake up that thread.
If the number of releases exceeds the number of acquires,
raise a ValueError.
z!Semaphore released too many timesr4 N)r] r^ r` rR r[ )r' r r r r< � s
zBoundedSemaphore.releaseN)rF r. r/ rG r( r< r r r r r � s c @ sg e Z d Z d Z d d � Z d d � Z d d � Z e Z d d � Z d
d � Z d d
d � Z
d S)r z�Class implementing event objects.
Events manage a flag that can be set to true with the set() method and reset
to false with the clear() method. The wait() method blocks until the flag is
true. The flag is initially false.
c C s t t � � | _ d | _ d S)NF)r r
r] �_flag)r' r r r r( � s zEvent.__init__c C s | j j t � � d S)N)r] r( r
)r' r r r �_reset_internal_locks� s zEvent._reset_internal_locksc C s | j S)z5Return true if and only if the internal flag is true.)ra )r' r r r �is_set� s z Event.is_setc C s+ | j � d | _ | j j � Wd QRXd S)z�Set the internal flag to true.
All threads waiting for it to become true are awakened. Threads
that call wait() once the flag is true will not block at all.
TN)r] ra r\ )r' r r r �set� s
z Event.setc C s | j � d | _ Wd QRXd S)z�Reset the internal flag to false.
Subsequently, threads calling wait() will block until set() is called to
set the internal flag to true again.
FN)r] ra )r' r r r �clear s
z Event.clearNc C s: | j �* | j } | s+ | j j | � } | SWd QRXd S)aH Block until the internal flag is true.
If the internal flag is true on entry, return immediately. Otherwise,
block until another thread calls set() to set the flag to true, or until
the optional timeout occurs.
When the timeout argument is present and not None, it should be a
floating point number specifying a timeout for the operation in seconds
(or fractions thereof).
This method returns the internal flag on exit, so it will always return
True except if a timeout is given and the operation times out.
N)r] ra rT )r' r8 Zsignaledr r r rT s
z
Event.wait) rF r. r/ rG r( rb rc ZisSetrd re rT r r r r r � s
c @ s� e Z d Z d Z d d d d � Z d d d � Z d d � Z d d
� Z d d � Z d
d � Z d d � Z
d d � Z d d � Z e
d d � � Z e
d d � � Z e
d d � � Z d S)r z�Implements a Barrier.
Useful for synchronizing a fixed number of threads at known synchronization
points. Threads block on 'wait()' and are simultaneously once they have all
made that call.
Nc C sC t t � � | _ | | _ | | _ | | _ d | _ d | _ d S)aW Create a barrier, initialised to 'parties' threads.
'action' is a callable which, when supplied, will be called by one of
the threads after they have all entered the barrier and just prior to
releasing them all. If a 'timeout' is provided, it is uses as the
default for all subsequent 'wait()' calls.
r N)r r
r] �_action�_timeout�_parties�_stater& )r' �parties�actionr8 r r r r( = s zBarrier.__init__c C s� | d k r | j } | j �y | j � | j } | j d 7_ z5 | d | j k rd | j � n
| j | � | SWd | j d 8_ | j � XWd QRXd S)aN Wait for the barrier.
When the specified number of threads have started waiting, they are all
simultaneously awoken. If an 'action' was provided for the barrier, one
of the threads will have executed that callback prior to returning.
Returns an individual index number from 0 to 'parties-1'.
Nr4 )rg r] �_enterr& rh �_release�_wait�_exit)r' r8 �indexr r r rT M s
z Barrier.waitc C s< x | j d k r" | j j � q W| j d k r8 t � d S)Nr4 r rE )rE r4 )ri r] rT �BrokenBarrierError)r' r r r rl k s
zBarrier._enterc C sI y- | j r | j � d | _ | j j � Wn | j � � Yn Xd S)Nr4 )rf ri r] r\ �_break)r' r r r rm v s
zBarrier._releasec sJ � j j � f d d � | � s1 � j � t � � j d k rF t � d S)Nc s
� j d k S)Nr )ri r )r' r r �<lambda>� s z Barrier._wait.<locals>.<lambda>r )r] rX rr rq ri )r' r8 r )r' r rn � s !
z
Barrier._waitc C s8 | j d k r4 | j d k r4 d | _ | j j � d S)Nr r4 rE )rE r4 )r& ri r] r\ )r' r r r ro � s z
Barrier._exitc C sp | j �` | j d k rO | j d k r4 d | _ qX | j d k rX d | _ n d | _ | j j � Wd QRXd S)z�Reset the barrier to the initial state.
Any threads currently waiting will get the BrokenBarrier exception
raised.
r r4 � NrE ���rE )r] r& ri r\ )r' r r r �reset� s
z
Barrier.resetc C s | j � | j � Wd QRXd S)z�Place the barrier into a 'broken' state.
Useful in case of error. Any currently waiting threads and threads
attempting to 'wait()' will have BrokenBarrierError raised.
N)r] rr )r' r r r �abort� s
z
Barrier.abortc C s d | _ | j j � d S)Nrt ru )ri r] r\ )r' r r r rr � s zBarrier._breakc C s | j S)z:Return the number of threads required to trip the barrier.)rh )r' r r r rj � s zBarrier.partiesc C s | j d k r | j Sd S)z>Return the number of threads currently waiting at the barrier.r )ri r& )r' r r r � n_waiting� s zBarrier.n_waitingc C s
| j d k S)z0Return True if the barrier is in a broken state.rt ru )ri )r' r r r �broken� s zBarrier.broken)rF r. r/ rG r( rT rl rm rn ro rv rw rr �propertyrj rx ry r r r r r 4 s
c @ s e Z d Z d S)rq N)rF r. r/ r r r r rq � s rq z Thread-%dc C s | t � S)N)�_counter)�templater r r �_newname� s r} c @ s� e Z d Z d Z d Z e j Z d d d f d d d d d �Z d d � Z d d
� Z
d d � Z d
d � Z d d � Z
d d � Z d d � Z d d � Z d d � Z d d � Z d d d � Z d d3 d d � Z e d! d" � � Z e j d# d" � � Z e d$ d% � � Z d& d' � Z e Z e d( d) � � Z e j d* d) � � Z d+ d, � Z d- d. � Z d/ d0 � Z d1 d2 � Z d S)4r a A class that represents a thread of control.
This class can be safely subclassed in a limited fashion. There are two ways
to specify the activity: by passing a callable object to the constructor, or
by overriding the run() method in a subclass.
FN�daemonc C s� | d k r i } | | _ t | p* t � � | _ | | _ | | _ | d k r] | | _ n t � j | _ d | _ d | _
t � | _ d | _
d | _ t j | _ t j | � d S)aK This constructor should always be called with keyword arguments. Arguments are:
*group* should be None; reserved for future extension when a ThreadGroup
class is implemented.
*target* is the callable object to be invoked by the run()
method. Defaults to None, meaning nothing is called.
*name* is the thread name. By default, a unique name is constructed of
the form "Thread-N" where N is a small decimal number.
*args* is the argument tuple for the target invocation. Defaults to ().
*kwargs* is a dictionary of keyword arguments for the target
invocation. Defaults to {}.
If a subclass overrides the constructor, it must make sure to invoke
the base class constructor (Thread.__init__()) before doing anything
else to the thread.
NFT)�_target�strr} �_name�_args�_kwargs� _daemonicr
r~ �_ident� _tstate_lockr �_started� _is_stopped� _initialized�_sys�stderr�_stderr� _dangling�add)r' �group�targetr+ r r! r~ r r r r( � s zThread.__init__c C s6 | j j � | r | j � n d | _ d | _ d S)NT)r� rb �_set_tstate_lockr� r� )r' �is_aliver r r rb s
z Thread._reset_internal_locksc C s� d } | j j � r d } | j � | j r4 d } | j rG | d 7} | j d k rg | d | j 7} d | j j | j | f S)N�initialZstartedZstoppedz daemonz %sz <%s(%s, %s)>) r� rc r� r� r� r� r- rF r� )r' Zstatusr r r r3 , s
zThread.__repr__c C s� | j s t d � � | j j � r0 t d � � t � | t | <Wd QRXy t | j f � Wn* t k
r� t � t | =Wd QRX� Yn X| j j � d S)a- Start the thread's activity.
It must be called at most once per thread object. It arranges for the
object's run() method to be invoked in a separate thread of control.
This method will raise a RuntimeError if called more than once on the
same thread object.
z thread.__init__() not calledz threads can only be started onceN)
r� r; r� rc �_active_limbo_lock�_limbo�_start_new_thread�
_bootstrap� ExceptionrT )r' r r r �start: s
z Thread.startc
C s= z# | j r" | j | j | j � Wd | ` | ` | ` Xd S)aX Method representing the thread's activity.
You may override this method in a subclass. The standard run() method
invokes the callable object passed to the object's constructor as the
target argument, if any, with sequential and keyword arguments taken
from the args and kwargs arguments, respectively.
N)r r� r� )r' r r r �runS s z
Thread.runc C s9 y | j � Wn$ | j r- t d k r- d S� Yn Xd S)N)�_bootstrap_innerr� r� )r' r r r r� d s
zThread._bootstrapc C s t � | _ d S)N)r5 r� )r' r r r �
_set_identx s zThread._set_identc C s t � | _ | j j � d S)z�
Set a lock object which will be released by the interpreter when
the underlying thread state (see pystate.h) gets deleted.
N)�
_set_sentinelr� r6 )r' r r r r� { s zThread._set_tstate_lockc 2 C s� z�| j � | j � | j j � t � | t | j <t | =Wd QRXt rY t j
t � t rl t j t � z7y | j
� Wn"t k
r� Ynt r� t j d k r� t d | j t � f d | j �n� | j d k r�| j � \ } } } z� t d | j d d | j �t d d | j �xH | rqt d | j j j | j | j j j f d | j �| j } q*Wt d | | f d | j �Wd ~ ~ ~ XYn XWd XWd t � y t t � =Wn Yn XWd QRXXd S)NzException in thread %s:
%s�filezException in thread z2 (most likely raised during interpreter shutdown):z"Traceback (most recent call last):z File "%s", line %s, in %sz%s: %s) r� r� r� rd r� r* r� r� r r� r r r r� �
SystemExitr� �printr+ � _format_excr� � _exc_info�tb_frame�f_code� co_filename� tb_lineno�co_name�tb_nextr5 )r' �exc_type� exc_valueZexc_tbr r r r� � sT
!zThread._bootstrap_innerc C s+ | j } | d k r d | _ d | _ d S)NT)r� r� )r' rM r r r �_stop� s z Thread._stopc C sG y t � t t � =Wd QRXWn$ t k
rB d t j k r> � Yn Xd S)zARemove current thread from the dict of currently running threads.NZdummy_threading)r� r* r5 r, r� �modules)r' r r r �_delete� s
zThread._deletec C s� | j s t d � � | j j � s0 t d � � | t � k rK t d � � | d k rd | j � n | j d t | d � � d S)a Wait until the thread terminates.
This blocks the calling thread until the thread whose join() method is
called terminates -- either normally or through an unhandled exception
or until the optional timeout occurs.
When the timeout argument is present and not None, it should be a
floating point number specifying a timeout for the operation in seconds
(or fractions thereof). As join() always returns None, you must call
isAlive() after join() to decide whether a timeout happened -- if the
thread is still alive, the join() call timed out.
When the timeout argument is not present or None, the operation will
block until the thread terminates.
A thread can be join()ed many times.
join() raises a RuntimeError if an attempt is made to join the current
thread as that would cause a deadlock. It is also an error to join() a
thread before it has been started and attempts to do so raises the same
exception.
z Thread.__init__() not calledz'cannot join thread before it is startedzcannot join current threadNr8 r )r� r; r� rc r
�_wait_for_tstate_lock�max)r' r8 r r r �join� s
z Thread.joinTr4 c C sB | j } | d k r n& | j | | � r> | j � | j � d S)N)r� r6 r< r� )r' �blockr8 rM r r r r� $ s
z Thread._wait_for_tstate_lockc C s | j S)z�A string used for identification purposes only.
It has no semantics. Multiple threads may be given the same name. The
initial name is set by the constructor.
)r� )r' r r r r+ 2 s z Thread.namec C s t | � | _ d S)N)r� r� )r' r+ r r r r+ = s c C s | j S)a; Thread identifier of this thread or None if it has not been started.
This is a nonzero integer. See the thread.get_ident() function. Thread
identifiers may be recycled when a thread exits and another thread is
created. The identifier is available even after the thread has exited.
)r� )r' r r r �identB s
z Thread.identc C s2 | j s | j j � r d S| j d � | j S)z�Return whether the thread is alive.
This method returns True just before the run() method starts until just
after the run() method terminates. The module function enumerate()
returns a list of all alive threads.
F)r� r� rc r� )r' r r r r� N s
zThread.is_alivec C s | j S)a� A boolean value indicating whether this thread is a daemon thread.
This must be set before start() is called, otherwise RuntimeError is
raised. Its initial value is inherited from the creating thread; the
main thread is not a daemon thread and therefore all threads created in
the main thread default to daemon = False.
The entire Python program exits when no alive non-daemon threads are
left.
)r� )r' r r r r~ ^ s z
Thread.daemonc C s= | j s t d � � | j j � r0 t d � � | | _ d S)Nz Thread.__init__() not calledz)cannot set daemon status of active thread)r� r; r� rc r� )r' �daemonicr r r r~ n s
c C s | j S)N)r~ )r' r r r �isDaemonv s zThread.isDaemonc C s
| | _ d S)N)r~ )r' r� r r r � setDaemony s zThread.setDaemonc C s | j S)N)r+ )r' r r r �getName| s zThread.getNamec C s
| | _ d S)N)r+ )r' r+ r r r �setName s zThread.setNamerE ) rF r. r/ rG r� r� �exc_infor� r( rb r3 r� r� r� r� r� r� r� r� r� r� rz r+ �setterr� r� ZisAliver~ r� r� r� r� r r r r r � s8 , A #& c @ s@ e Z d Z d Z d d d d � Z d d � Z d d � Z d S) r z�Call a function after a specified number of seconds:
t = Timer(30.0, f, args=None, kwargs=None)
t.start()
t.cancel() # stop the timer's action if it's still waiting
Nc C se t j | � | | _ | | _ | d k r1 | n g | _ | d k rL | n i | _ t � | _ d S)N)r r( �interval�functionr r! r �finished)r' r� r� r r! r r r r( � s
zTimer.__init__c C s | j j � d S)z)Stop the timer if it hasn't finished yet.N)r� rd )r' r r r �cancel� s z Timer.cancelc C sI | j j | j � | j j � s8 | j | j | j � | j j � d S)N)r� rT r� rc r� r r! rd )r' r r r r� � s z Timer.run)rF r. r/ rG r( r� r� r r r r r � s c @ s e Z d Z d d � Z d S)� _MainThreadc
C sY t j | d d d d �| j � | j j � | j � t � | t | j <Wd QRXd S)Nr+ Z
MainThreadr~ F) r r( r� r� rd r� r� r* r� )r' r r r r( � s
z_MainThread.__init__N)rF r. r/ r( r r r r r� � s r� c @ s7 e Z d Z d d � Z d d � Z d d d � Z d S)� _DummyThreadc
C sU t j | d t d � d d �| j j � | j � t � | t | j <Wd QRXd S)Nr+ zDummy-%dr~ T) r r( r} r� rd r� r� r* r� )r' r r r r( � s
z_DummyThread.__init__c C s d S)Nr )r' r r r r� � s z_DummyThread._stopNc C s d S)Nr )r' r8 r r r r� � s z_DummyThread.join)rF r. r/ r( r� r� r r r r r� � s r� c C s/ y t t � SWn t k
r* t � SYn Xd S)z�Return the current Thread object, corresponding to the caller's thread of control.
If the caller's thread of control was not created through the threading
module, a dummy thread object with limited functionality is returned.
N)r* r5 r, r� r r r r r
� s
c
C s& t � t t � t t � SWd QRXd S)z�Return the number of Thread objects currently alive.
The returned count is equal to the length of the list returned by
enumerate().
N)r� rN r* r� r r r r r � s c C s t t j � � t t j � � S)N)�listr* �valuesr� r r r r �
_enumerate� s r� c
C s2 t �% t t j � � t t j � � SWd QRXd S)z�Return a list of all Thread objects currently alive.
The list includes daemonic threads, dummy thread objects created by
current_thread(), and the main thread. It excludes terminated threads and
threads that have not yet been started.
N)r� r� r* r� r� r r r r r � s )r c C sT t j } | j � t j � t � } x | rE | j � t � } q) Wt j � d S)N)� _main_threadr� r< r� �_pickSomeNonDaemonThreadr� r� )Ztlockr= r r r � _shutdown� s
r� c C s2 x+ t � D] } | j r
| j � r
| Sq
Wd S)N)r r~ r� )r= r r r r� s r� c C s t S)z�Return the main thread object.
In normal conditions, the main thread is the thread from which the
Python interpreter was started.
)r� r r r r � main_thread s r� )�_local)r c C s� t � a i } t � } | a t �� t t � � } | j t � x] | D]U } | | k r� | j d � t � } | | _
| | | <qH | j d � | j � qH Wt j
� t j
� t j | � Wd QRXd S)NTF)r# r� r
r� rd r� �updater� rb r5 r� r� r� re r* )Z
new_activeZcurrentZthreadsZthreadr� r r r � _after_fork# s&
r� )KrG �sysr� �_threadZtimer rU � tracebackr r� � _weakrefsetr � itertoolsr rY r r& � _collectionsr rK � ImportError� collections�__all__�start_new_threadr� �
allocate_lockr# r� r5 �errorr r r rJ � TIMEOUT_MAXr r r r r
r" r r r r r r r; rq �__next__r{ r} r� r* r� r� r r r� r� r
Z
currentThreadr Z activeCountr� r r r� r� r� r� r� r Z_threading_localr� r r r r �<module> s�
q�P&O� � �
Rosenblum TV: Video training, virtual workshops, classes, tutorials
RE-INVENTING THE TELEVISION NEWS BUSINESS*
A revolution in video storytelling
Creating entirely new & cost-effective production methods
From the world leaders in video production training and the creators of Character Driven Storytelling™
*and every other business that uses video
WHAT WE DO
Over the past 35 years, we have designed, built or restructured some of the most powerful news and journalism companies in the world.
We replace the traditional TV news ‘crew’ with one highly trained journalist, working alone with nothing but an iPhone.
No more TV news ‘crews’, no editors and no field producers.
This is television news done the way newspaper journalism is done – one reporter with their electronic pad and pencil.
In doing this, we can cut the cost of production by as much as 75% while increasing ratings and audience engagement.
In the place of conventional TV news ‘packages’ – ie, reporter stand up, interview, b-roll, man on the street, we marry great journalism with Netflix and Hollywood storytelling.
It’s a combination that works.
We have taken most of our clients to #1 in their respective markets.
And it’s not just for news. Any company, any profit, any NGO and anyone else who is online needs to tell their story in compelling yet cost-effective video. We can teach you to do that. Either in person or virtually.
EXAMPLES OF WHAT WE CAN TEACH YOUR STAFF TO PRODUCE
ITAY HOD
Itay Hod, MMJ with KPIX/CBS in San Francisco, took the 5-Day Intensive Video Storytelling Bootcamp in 2018.
Because he works alone, with only an iPhone, he was able to embed himself with a homeless family.
Here’s the story he produced in a one-day turn.
KIET DO
Kiet Do, an MMJ with KPIX/CBS in San Francisco, took the 5-Day Intensive Video Storytelling Bootcamp in 2021.
Here is a story he produced, all on his own, with only an iPhone and in a one-day turn.
TAYLOR SCHAUB
Taylor Schaub, an MMJ with Spectrum News 1 in LA, took the 5-Day Intensive Video Storytelling Bootcamp in 2023.
Here is a story he turned in only one day, using only an iPhone. It was the first video story he ever did and it was nominated for an Emmy.
THE BOOTCAMP
How do we convert stations and whole networks to working in this way?
Since 1988, we have run intensive 5-Day Video Storytelling Bootcamps
We have done these all over the world.
These are hands-on bootcamps, and participants learn an entirely new way of creating TV news stories.
-We shoot at a 3:1 ratio or lower, so turnaround times are fast.
-We go directly from camera to timelilne and edit – no written scripts. We work in the medium of pictures and sound.
-We are entirely character-driven.
-We are driven by pictures and real events.
-We are focused almost entirely on ’the viewer experience’.
Since 1988, more than 70,000 journalists around the world have taken our bootcamps, either in person on virtualy.
We have started to work with CBS News, bringing our ideas of character-driven storytelling to one of the most successful and biggest networks in the United States. Since beginning to work with them ratings have climbed and more importantly, audience engagement is through the ceiling.
We started New York Times Television in 1990 and it was the first paper to be brought into the world of TV. It quickly became one of the most successful non-fiction production companies in the United States. The series and documentaries we produced won many awards including multiple Emmys.
We have been working with the BBC since the year 2000 helping to convert their national news network to our visual storytelling technique. Most recently we have trained teams from their sports, documentaries, and comedy divisions to make character-driven stories using only smartphones.
For the past five years we have worked with Spectrum News to introduce and train their journalists on visual, character driven storytelling using smartphones helping to create a different kind of local news for their network of 24-Hour News Stations across the United States.
In 2006, we were approached by the United Nations. Rather than rely on news outlets, it would be much easier to train the field operatives to produce their own stories. We spent two years working with the UN, training more than 100 of their staff in bootcamps in Geneva and Nairobi.
We trained 50 print reporters at the paper to shoot and tell their own stories, in conjunction with their print work. We built a TV newsroom in their existing print newsroom – you could not ask for a better set and they began to live stream their stories in conjunction with their print work.
We spent two years with McGraw Hill, training more than 150 of their staffers, making them completely video literate. McGraw/Hill media properties we transit included Business Week, Aviation Week, (what was the name of the architecture magazine), and JD Power and Associates.
In 1990, we were approached by The Voice of America, the official broadcasting agency for the United States Government. When we met with VOA, they were only a short wave radio broadcaster, but working with them, we took them into television, launching VOA-TV.
British based Oyster Yachts makes some of the finest yachts in the world. Like every other company, they had to find a way to feed the never-ending video demands of social media – sites like Instagram and TikTok. We trained the Oyster staff to tell their own stories, using only iPhones.
We were approached by SEPA, the Scottish Environmental Protection Agency because they had to continually find a way to ‘feed the media beast’. The result was that SEPA was able to tell their own stories, whenever they wanted, and at almost no additional cost.
Michael Rosenblum has been writing about the media since 1988. His work and ideas have appeared in The Guardian, The Huffington Post, Ilkeston Life and many other publications.
He has been blogging regularly for the past 35 years on this subject. Having taught media studies at Columbia University, NYU and now the University of Oxford, he is considered an expert on this subject.
Continue reading this post or look back at previous posts.
