/opt/alt/python35/lib64/python3.5/asyncio/__pycache__/
/opt/alt/python35/lib64/python3.5/asyncio/__pycache__
NameSizeModeActions
base_events.cpython-35.opt-1.pyc413790644editdlrm
base_events.cpython-35.opt-2.pyc337780644editdlrm
base_events.cpython-35.pyc416590644editdlrm
base_subprocess.cpython-35.opt-1.pyc99330644editdlrm
base_subprocess.cpython-35.opt-2.pyc98230644editdlrm
base_subprocess.cpython-35.pyc100580644editdlrm
compat.cpython-35.opt-1.pyc7940644editdlrm
compat.cpython-35.opt-2.pyc6650644editdlrm
compat.cpython-35.pyc7940644editdlrm
constants.cpython-35.opt-1.pyc2420644editdlrm
constants.cpython-35.opt-2.pyc2050644editdlrm
constants.cpython-35.pyc2420644editdlrm
coroutines.cpython-35.opt-1.pyc89840644editdlrm
coroutines.cpython-35.opt-2.pyc87440644editdlrm
coroutines.cpython-35.pyc91170644editdlrm
events.cpython-35.opt-1.pyc259460644editdlrm
events.cpython-35.opt-2.pyc184590644editdlrm
events.cpython-35.pyc260820644editdlrm
futures.cpython-35.opt-1.pyc158730644editdlrm
futures.cpython-35.opt-2.pyc97460644editdlrm
futures.cpython-35.pyc161570644editdlrm
locks.cpython-35.opt-1.pyc160870644editdlrm
locks.cpython-35.opt-2.pyc95240644editdlrm
locks.cpython-35.pyc160870644editdlrm
log.cpython-35.opt-1.pyc2440644editdlrm
log.cpython-35.opt-2.pyc1950644editdlrm
log.cpython-35.pyc2440644editdlrm
proactor_events.cpython-35.opt-1.pyc177930644editdlrm
proactor_events.cpython-35.opt-2.pyc173730644editdlrm
proactor_events.cpython-35.pyc180390644editdlrm
protocols.cpython-35.opt-1.pyc60910644editdlrm
protocols.cpython-35.opt-2.pyc23160644editdlrm
protocols.cpython-35.pyc60910644editdlrm
queues.cpython-35.opt-1.pyc88330644editdlrm
queues.cpython-35.opt-2.pyc59500644editdlrm
queues.cpython-35.pyc88330644editdlrm
selector_events.cpython-35.opt-1.pyc325760644editdlrm
selector_events.cpython-35.opt-2.pyc309740644editdlrm
selector_events.cpython-35.pyc326410644editdlrm
sslproto.cpython-35.opt-1.pyc214360644editdlrm
sslproto.cpython-35.opt-2.pyc145940644editdlrm
sslproto.cpython-35.pyc216870644editdlrm
streams.cpython-35.opt-1.pyc205650644editdlrm
streams.cpython-35.opt-2.pyc142670644editdlrm
streams.cpython-35.pyc208970644editdlrm
subprocess.cpython-35.opt-1.pyc74800644editdlrm
subprocess.cpython-35.opt-2.pyc73030644editdlrm
subprocess.cpython-35.pyc75160644editdlrm
tasks.cpython-35.opt-1.pyc213380644editdlrm
tasks.cpython-35.opt-2.pyc144190644editdlrm
tasks.cpython-35.pyc215420644editdlrm
test_utils.cpython-35.opt-1.pyc177360644editdlrm
test_utils.cpython-35.opt-2.pyc164240644editdlrm
test_utils.cpython-35.pyc181430644editdlrm
transports.cpython-35.opt-1.pyc124370644editdlrm
transports.cpython-35.opt-2.pyc67980644editdlrm
transports.cpython-35.pyc124730644editdlrm
unix_events.cpython-35.opt-1.pyc322870644editdlrm
unix_events.cpython-35.opt-2.pyc285680644editdlrm
unix_events.cpython-35.pyc327010644editdlrm
windows_events.cpython-35.opt-1.pyc231540644editdlrm
windows_events.cpython-35.opt-2.pyc220180644editdlrm
windows_events.cpython-35.pyc231540644editdlrm
windows_utils.cpython-35.opt-1.pyc57930644editdlrm
windows_utils.cpython-35.opt-2.pyc51940644editdlrm
windows_utils.cpython-35.pyc58950644editdlrm
__init__.cpython-35.opt-1.pyc8670644editdlrm
__init__.cpython-35.opt-2.pyc8010644editdlrm
__init__.cpython-35.pyc8670644editdlrm
Edit: /opt/alt/python35/lib64/python3.5/asyncio/__pycache__/locks.cpython-35.opt-1.pyc (16087B)
 yzf:@sdZdddddgZddlZdd lmZdd lmZdd lmZdd lmZGd ddZ GdddZ Gddde Z GdddZ Gddde Z Gddde ZGdddeZdS)zSynchronization primitives.LockEvent Condition SemaphoreBoundedSemaphoreN)compat)events)futures) coroutinec@s:eZdZdZddZddZddZdS) _ContextManageraContext manager. This enables the following idiom for acquiring and releasing a lock around a block: with (yield from lock): while failing loudly when accidentally using: with lock: cCs ||_dS)N)_lock)selflockr2/opt/alt/python35/lib64/python3.5/asyncio/locks.py__init__sz_ContextManager.__init__cCsdS)Nr)rrrr __enter__sz_ContextManager.__enter__c Gs"z|jjWdd|_XdS)N)r release)rargsrrr__exit__$sz_ContextManager.__exit__N)__name__ __module__ __qualname____doc__rrrrrrrr s   r c@sseZdZddZddZeddZejroddZ ed d Z ed d Z d S)_ContextManagerMixincCstddS)Nz9"yield from" should be used as context manager expression) RuntimeError)rrrrr,sz_ContextManagerMixin.__enter__cGsdS)Nr)rrrrrr0sz_ContextManagerMixin.__exit__ccs|jEdHt|S)N)acquirer )rrrr__iter__5sz_ContextManagerMixin.__iter__ccs|jEdHt|S)N)rr )rrrr __await__Hsz_ContextManagerMixin.__await__ccs|jEdHdS)N)r)rrrr __aenter__Msz_ContextManagerMixin.__aenter__cCs|jdS)N)r)rexc_typeexctbrrr __aexit__Tsz_ContextManagerMixin.__aexit__N) rrrrrr rrZPY35rr r$rrrrr+s     rcspeZdZdZddddZfddZdd Zed d Zd d Z ddZ S)raPrimitive lock objects. A primitive lock is a synchronization primitive that is not owned by a particular coroutine when locked. A primitive lock is in one of two states, 'locked' or 'unlocked'. It is created in the unlocked state. It has two basic methods, acquire() and release(). When the state is unlocked, acquire() changes the state to locked and returns immediately. When the state is locked, acquire() blocks until a call to release() in another coroutine changes it to unlocked, then the acquire() call resets it to locked and returns. The release() method should only be called in the locked state; it changes the state to unlocked and returns immediately. If an attempt is made to release an unlocked lock, a RuntimeError will be raised. When more than one coroutine is blocked in acquire() waiting for the state to turn to unlocked, only one coroutine proceeds when a release() call resets the state to unlocked; first coroutine which is blocked in acquire() is being processed. acquire() is a coroutine and should be called with 'yield from'. Locks also support the context management protocol. '(yield from lock)' should be used as the context manager expression. Usage: lock = Lock() ... yield from lock try: ... finally: lock.release() Context manager usage: lock = Lock() ... with (yield from lock): ... Lock objects can be tested for locking state: if not lock.locked(): yield from lock else: # lock is acquired ... loopNcCsCtj|_d|_|dk r0||_ntj|_dS)NF) collectionsdeque_waiters_locked_loopr get_event_loop)rr%rrrrs    z Lock.__init__csbtj}|jrdnd}|jrHdj|t|j}dj|dd|S)Nlockedunlockedz {},waiters:{}z <{} [{}]>r)super__repr__r)r(formatlen)rresextra) __class__rrr0s  z Lock.__repr__cCs|jS)z Return True if lock is acquired.)r))rrrrr,sz Lock.lockedccs|j r3tdd|jDr3d|_dS|jj}|jj|zLy|EdHd|_dSWn+tjk r|js|jYnXWd|jj |XdS)zAcquire a lock. This method blocks until the lock is unlocked, then sets it to locked and returns True. css|]}|jVqdS)N) cancelled).0wrrr szLock.acquire..TN) r)allr(r* create_futureappendr CancelledError_wake_up_firstremove)rfutrrrrs&      z Lock.acquirecCs/|jrd|_|jn tddS)aGRelease a lock. When the lock is locked, reset it to unlocked, and return. If any other coroutines are blocked waiting for the lock to become unlocked, allow exactly one of them to proceed. When invoked on an unlocked lock, a RuntimeError is raised. There is no return value. FzLock is not acquired.N)r)r>r)rrrrrs   z Lock.releasecCs2x+|jD] }|js |jdPq WdS)z-Wake up the first waiter who isn't cancelled.TN)r(done set_result)rr@rrrr>s  zLock._wake_up_first) rrrrrr0r,r rrr>rr)r5rrYs 4  cspeZdZdZddddZfddZdd Zd d Zd d Ze ddZ S)ra#Asynchronous equivalent to threading.Event. Class implementing event objects. An event manages 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. r%NcCsCtj|_d|_|dk r0||_ntj|_dS)NF)r&r'r(_valuer*r r+)rr%rrrrs    zEvent.__init__csbtj}|jrdnd}|jrHdj|t|j}dj|dd|S)NsetZunsetz {},waiters:{}z <{} [{}]>rr.)r/r0rCr(r1r2)rr3r4)r5rrr0s  zEvent.__repr__cCs|jS)z5Return True if and only if the internal flag is true.)rC)rrrris_setsz Event.is_setcCsC|js?d|_x*|jD]}|js|jdqWdS)zSet the internal flag to true. All coroutines waiting for it to become true are awakened. Coroutine that call wait() once the flag is true will not block at all. TN)rCr(rArB)rr@rrrrDs    z Event.setcCs d|_dS)zReset the internal flag to false. Subsequently, coroutines calling wait() will block until set() is called to set the internal flag to true again.FN)rC)rrrrclearsz Event.clearc csU|jr dS|jj}|jj|z|EdHdSWd|jj|XdS)zBlock until the internal flag is true. If the internal flag is true on entry, return True immediately. Otherwise, block until another coroutine calls set() to set the flag to true, then return True. TN)rCr*r;r(r<r?)rr@rrrwaits  z Event.wait) rrrrrr0rErDrFr rGrr)r5rrs   cs|eZdZdZdddddZfddZedd Zed d Zd d dZ ddZ S)raAsynchronous equivalent to threading.Condition. This class implements condition variable objects. A condition variable allows one or more coroutines to wait until they are notified by another coroutine. A new Lock object is created and used as the underlying lock. Nr%cCs|dk r||_ntj|_|dkrHtd|j}n|j|jk rftd||_|j|_|j|_|j|_t j |_ dS)Nr%z"loop argument must agree with lock) r*r r+r ValueErrorr r,rrr&r'r()rrr%rrrrs        zCondition.__init__csetj}|jr!dnd}|jrKdj|t|j}dj|dd|S)Nr,r-z {},waiters:{}z <{} [{}]>rr.)r/r0r,r(r1r2)rr3r4)r5rrr02s  zCondition.__repr__ccs|jstd|jzH|jj}|jj|z|EdHdSWd|jj|XWdx0y|jEdHPWqpt j k rYqpXqpWXdS)aWait until notified. If the calling coroutine 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 coroutine. Once awakened, it re-acquires the lock and returns True. zcannot wait on un-acquired lockNT) r,rrr*r;r(r<r?rr r=)rr@rrrrG9s    zCondition.waitccs2|}x"|s-|jEdH|}q W|S)zWait until a predicate becomes true. The predicate should be a callable which result will be interpreted as a boolean value. The final predicate value is the return value. N)rG)rZ predicateresultrrrwait_for[s    zCondition.wait_forrcCsf|jstdd}xA|jD]6}||kr;P|js(|d7}|jdq(WdS)aBy default, wake up one coroutine waiting on this condition, if any. If the calling coroutine has not acquired the lock when this method is called, a RuntimeError is raised. This method wakes up at most n of the coroutines waiting for the condition variable; it is a no-op if no coroutines are waiting. Note: an awakened coroutine does not actually return from its wait() call until it can reacquire the lock. Since notify() does not release the lock, its caller should. z!cannot notify on un-acquired lockrrFN)r,rr(rArB)rnidxr@rrrnotifyis     zCondition.notifycCs|jt|jdS)aWake up all threads waiting on this condition. This method acts like notify(), but wakes up all waiting threads instead of one. If the calling thread has not acquired the lock when this method is called, a RuntimeError is raised. N)rMr2r()rrrr notify_allszCondition.notify_all) rrrrrr0r rGrJrMrNrr)r5rrs "csseZdZdZdddddZfddZd d Zd d Zed dZ ddZ S)raA Semaphore implementation. A semaphore manages an internal counter which is decremented by each acquire() call and incremented by each release() call. The counter can never go below zero; when acquire() finds that it is zero, it blocks, waiting until some other thread calls release(). Semaphores also support the context management protocol. The optional argument gives the initial value for the internal counter; it defaults to 1. If the value given is less than 0, ValueError is raised. rr%NcCs[|dkrtd||_tj|_|dk rH||_ntj|_dS)Nrz$Semaphore initial value must be >= 0)rHrCr&r'r(r*r r+)rvaluer%rrrrs     zSemaphore.__init__csqtj}|jr!dndj|j}|jrWdj|t|j}dj|dd|S)Nr,zunlocked,value:{}z {},waiters:{}z <{} [{}]>rr.)r/r0r,r1rCr(r2)rr3r4)r5rrr0s   zSemaphore.__repr__cCs@x9|jr;|jj}|js|jddSqWdS)N)r(popleftrArB)rZwaiterrrr _wake_up_nexts    zSemaphore._wake_up_nextcCs |jdkS)z:Returns True if semaphore can not be acquired immediately.r)rC)rrrrr,szSemaphore.lockedc csx}|jdkr|jj}|jj|y |EdHWq|j|jdkrt|j rt|jYqXqW|jd8_dS)a5Acquire a semaphore. If the internal counter is larger than zero on entry, decrement it by one and return True immediately. If it is zero on entry, block, waiting until some other coroutine has called release() to make it larger than 0, and then return True. rNrT)rCr*r;r(r<Zcancelr6rQ)rr@rrrrs     zSemaphore.acquirecCs|jd7_|jdS)zRelease a semaphore, incrementing the internal counter by one. When it was zero on entry and another coroutine is waiting for it to become larger than zero again, wake up that coroutine. rN)rCrQ)rrrrrszSemaphore.release) rrrrrr0rQr,r rrrr)r5rrs    csCeZdZdZdddfddZfddZS) rzA bounded semaphore implementation. This raises ValueError in release() if it would increase the value above the initial value. rr%Ncs#||_tj|d|dS)Nr%) _bound_valuer/r)rrOr%)r5rrrs zBoundedSemaphore.__init__cs/|j|jkrtdtjdS)Nz(BoundedSemaphore released too many times)rCrRrHr/r)r)r5rrrs zBoundedSemaphore.release)rrrrrrrr)r5rrs )r__all__r&rr r Z coroutinesr r rrrrrrrrrrs .zBuM