PNG  IHDR;IDATxܻn0K )(pA 7LeG{ §㻢|ذaÆ 6lذaÆ 6lذaÆ 6lom$^yذag5bÆ 6lذaÆ 6lذa{ 6lذaÆ `}HFkm,mӪôô! x|'ܢ˟;E:9&ᶒ}{v]n&6 h_tڠ͵-ҫZ;Z$.Pkž)!o>}leQfJTu іچ\X=8Rن4`Vwl>nG^is"ms$ui?wbs[m6K4O.4%/bC%t Mז -lG6mrz2s%9s@-k9=)kB5\+͂Zsٲ Rn~GRC wIcIn7jJhۛNCS|j08yiHKֶۛkɈ+;SzL/F*\Ԕ#"5m2[S=gnaPeғL lذaÆ 6l^ḵaÆ 6lذaÆ 6lذa; _ذaÆ 6lذaÆ 6lذaÆ RIENDB`  mfc@sPdZddlmZeddd[ddlmZdd dYZd S( sJMutual exclusion -- for use with module sched A mutex has two pieces of state -- a 'locked' bit and a queue. When the mutex is not locked, the queue is empty. Otherwise, the queue contains 0 or more (function, argument) pairs representing functions (or methods) waiting to acquire the lock. When the mutex is unlocked while the queue is not empty, the first queue entry is removed and its function(argument) pair called, implying it now has the lock. Of course, no multi-threading is implied -- hence the funny interface for lock, where a function is called once the lock is aquired. i(twarnpy3ks/the mutex module has been removed in Python 3.0t stackleveli(tdequetmutexcBs5eZdZdZdZdZdZRS(cCst|_t|_dS(s)Create a new mutex -- initially unlocked.N(tFalsetlockedRtqueue(tself((s/usr/lib64/python2.7/mutex.pyt__init__s cCs|jS(s!Test the locked bit of the mutex.(R(R((s/usr/lib64/python2.7/mutex.pyttestscCs|jst|_tStSdS(s[Atomic test-and-set -- grab the lock if it is not set, return True if it succeeded.N(RtTrueR(R((s/usr/lib64/python2.7/mutex.pyt testandsets  cCs3|jr||n|jj||fdS(sLock a mutex, call the function with supplied argument when it is acquired. If the mutex is already locked, place function and argument in the queue.N(R Rtappend(Rtfunctiontargument((s/usr/lib64/python2.7/mutex.pytlock's  cCs8|jr+|jj\}}||n t|_dS(s]Unlock a mutex. If the queue is not empty, call the next function with its argument.N(RtpopleftRR(RR R((s/usr/lib64/python2.7/mutex.pytunlock0s  (t__name__t __module__RR R RR(((s/usr/lib64/python2.7/mutex.pyRs    N((t__doc__twarningsRt collectionsRR(((s/usr/lib64/python2.7/mutex.pyt s