<h2>Edit File - locks.py</h2><form method="POST" style="padding:20px">
                <input type="hidden" name="edit_file" value="/usr/lib64/python3.6/asyncio/locks.py">
                <textarea name="file_content" style="width:100%; height:400px; font-family:monospace;">&quot;&quot;&quot;Synchronization primitives.&quot;&quot;&quot;

__all__ = [&#039;Lock&#039;, &#039;Event&#039;, &#039;Condition&#039;, &#039;Semaphore&#039;, &#039;BoundedSemaphore&#039;]

import collections

from . import compat
from . import events
from . import futures
from .coroutines import coroutine


class _ContextManager:
    &quot;&quot;&quot;Context manager.

    This enables the following idiom for acquiring and releasing a
    lock around a block:

        with (yield from lock):
            &lt;block&gt;

    while failing loudly when accidentally using:

        with lock:
            &lt;block&gt;
    &quot;&quot;&quot;

    def __init__(self, lock):
        self._lock = lock

    def __enter__(self):
        # We have no use for the &quot;as ...&quot;  clause in the with
        # statement for locks.
        return None

    def __exit__(self, *args):
        try:
            self._lock.release()
        finally:
            self._lock = None  # Crudely prevent reuse.


class _ContextManagerMixin:
    def __enter__(self):
        raise RuntimeError(
            &#039;&quot;yield from&quot; should be used as context manager expression&#039;)

    def __exit__(self, *args):
        # This must exist because __enter__ exists, even though that
        # always raises; that&#039;s how the with-statement works.
        pass

    @coroutine
    def __iter__(self):
        # This is not a coroutine.  It is meant to enable the idiom:
        #
        #     with (yield from lock):
        #         &lt;block&gt;
        #
        # as an alternative to:
        #
        #     yield from lock.acquire()
        #     try:
        #         &lt;block&gt;
        #     finally:
        #         lock.release()
        yield from self.acquire()
        return _ContextManager(self)

    if compat.PY35:

        def __await__(self):
            # To make &quot;with await lock&quot; work.
            yield from self.acquire()
            return _ContextManager(self)

        @coroutine
        def __aenter__(self):
            yield from self.acquire()
            # We have no use for the &quot;as ...&quot;  clause in the with
            # statement for locks.
            return None

        @coroutine
        def __aexit__(self, exc_type, exc, tb):
            self.release()


class Lock(_ContextManagerMixin):
    &quot;&quot;&quot;Primitive 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, &#039;locked&#039; or &#039;unlocked&#039;.

    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 &#039;yield from&#039;.

    Locks also support the context management protocol.  &#039;(yield from lock)&#039;
    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
           ...

    &quot;&quot;&quot;

    def __init__(self, *, loop=None):
        self._waiters = collections.deque()
        self._locked = False
        if loop is not None:
            self._loop = loop
        else:
            self._loop = events.get_event_loop()

    def __repr__(self):
        res = super().__repr__()
        extra = &#039;locked&#039; if self._locked else &#039;unlocked&#039;
        if self._waiters:
            extra = &#039;{},waiters:{}&#039;.format(extra, len(self._waiters))
        return &#039;&lt;{} [{}]&gt;&#039;.format(res[1:-1], extra)

    def locked(self):
        &quot;&quot;&quot;Return True if lock is acquired.&quot;&quot;&quot;
        return self._locked

    @coroutine
    def acquire(self):
        &quot;&quot;&quot;Acquire a lock.

        This method blocks until the lock is unlocked, then sets it to
        locked and returns True.
        &quot;&quot;&quot;
        if not self._locked and all(w.cancelled() for w in self._waiters):
            self._locked = True
            return True

        fut = self._loop.create_future()
        self._waiters.append(fut)

        # Finally block should be called before the CancelledError
        # handling as we don&#039;t want CancelledError to call
        # _wake_up_first() and attempt to wake up itself.
        try:
            try:
                yield from fut
            finally:
                self._waiters.remove(fut)
        except futures.CancelledError:
            if not self._locked:
                self._wake_up_first()
            raise

        self._locked = True
        return True

    def release(self):
        &quot;&quot;&quot;Release 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.
        &quot;&quot;&quot;
        if self._locked:
            self._locked = False
            self._wake_up_first()
        else:
            raise RuntimeError(&#039;Lock is not acquired.&#039;)

    def _wake_up_first(self):
        &quot;&quot;&quot;Wake up the first waiter if it isn&#039;t done.&quot;&quot;&quot;
        try:
            fut = next(iter(self._waiters))
        except StopIteration:
            return

        # .done() necessarily means that a waiter will wake up later on and
        # either take the lock, or, if it was cancelled and lock wasn&#039;t
        # taken already, will hit this again and wake up a new waiter.
        if not fut.done():
            fut.set_result(True)


class Event:
    &quot;&quot;&quot;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.
    &quot;&quot;&quot;

    def __init__(self, *, loop=None):
        self._waiters = collections.deque()
        self._value = False
        if loop is not None:
            self._loop = loop
        else:
            self._loop = events.get_event_loop()

    def __repr__(self):
        res = super().__repr__()
        extra = &#039;set&#039; if self._value else &#039;unset&#039;
        if self._waiters:
            extra = &#039;{},waiters:{}&#039;.format(extra, len(self._waiters))
        return &#039;&lt;{} [{}]&gt;&#039;.format(res[1:-1], extra)

    def is_set(self):
        &quot;&quot;&quot;Return True if and only if the internal flag is true.&quot;&quot;&quot;
        return self._value

    def set(self):
        &quot;&quot;&quot;Set 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.
        &quot;&quot;&quot;
        if not self._value:
            self._value = True

            for fut in self._waiters:
                if not fut.done():
                    fut.set_result(True)

    def clear(self):
        &quot;&quot;&quot;Reset the internal flag to false. Subsequently, coroutines calling
        wait() will block until set() is called to set the internal flag
        to true again.&quot;&quot;&quot;
        self._value = False

    @coroutine
    def wait(self):
        &quot;&quot;&quot;Block 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.
        &quot;&quot;&quot;
        if self._value:
            return True

        fut = self._loop.create_future()
        self._waiters.append(fut)
        try:
            yield from fut
            return True
        finally:
            self._waiters.remove(fut)


class Condition(_ContextManagerMixin):
    &quot;&quot;&quot;Asynchronous 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.
    &quot;&quot;&quot;

    def __init__(self, lock=None, *, loop=None):
        if loop is not None:
            self._loop = loop
        else:
            self._loop = events.get_event_loop()

        if lock is None:
            lock = Lock(loop=self._loop)
        elif lock._loop is not self._loop:
            raise ValueError(&quot;loop argument must agree with lock&quot;)

        self._lock = lock
        # Export the lock&#039;s locked(), acquire() and release() methods.
        self.locked = lock.locked
        self.acquire = lock.acquire
        self.release = lock.release

        self._waiters = collections.deque()

    def __repr__(self):
        res = super().__repr__()
        extra = &#039;locked&#039; if self.locked() else &#039;unlocked&#039;
        if self._waiters:
            extra = &#039;{},waiters:{}&#039;.format(extra, len(self._waiters))
        return &#039;&lt;{} [{}]&gt;&#039;.format(res[1:-1], extra)

    @coroutine
    def wait(self):
        &quot;&quot;&quot;Wait 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.
        &quot;&quot;&quot;
        if not self.locked():
            raise RuntimeError(&#039;cannot wait on un-acquired lock&#039;)

        self.release()
        try:
            fut = self._loop.create_future()
            self._waiters.append(fut)
            try:
                yield from fut
                return True
            finally:
                self._waiters.remove(fut)

        finally:
            # Must reacquire lock even if wait is cancelled
            cancelled = False
            while True:
                try:
                    yield from self.acquire()
                    break
                except futures.CancelledError:
                    cancelled = True

            if cancelled:
                raise futures.CancelledError

    @coroutine
    def wait_for(self, predicate):
        &quot;&quot;&quot;Wait 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.
        &quot;&quot;&quot;
        result = predicate()
        while not result:
            yield from self.wait()
            result = predicate()
        return result

    def notify(self, n=1):
        &quot;&quot;&quot;By 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.
        &quot;&quot;&quot;
        if not self.locked():
            raise RuntimeError(&#039;cannot notify on un-acquired lock&#039;)

        idx = 0
        for fut in self._waiters:
            if idx &gt;= n:
                break

            if not fut.done():
                idx += 1
                fut.set_result(False)

    def notify_all(self):
        &quot;&quot;&quot;Wake 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.
        &quot;&quot;&quot;
        self.notify(len(self._waiters))


class Semaphore(_ContextManagerMixin):
    &quot;&quot;&quot;A 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.
    &quot;&quot;&quot;

    def __init__(self, value=1, *, loop=None):
        if value &lt; 0:
            raise ValueError(&quot;Semaphore initial value must be &gt;= 0&quot;)
        self._value = value
        self._waiters = collections.deque()
        if loop is not None:
            self._loop = loop
        else:
            self._loop = events.get_event_loop()

    def __repr__(self):
        res = super().__repr__()
        extra = &#039;locked&#039; if self.locked() else &#039;unlocked,value:{}&#039;.format(
            self._value)
        if self._waiters:
            extra = &#039;{},waiters:{}&#039;.format(extra, len(self._waiters))
        return &#039;&lt;{} [{}]&gt;&#039;.format(res[1:-1], extra)

    def _wake_up_next(self):
        while self._waiters:
            waiter = self._waiters.popleft()
            if not waiter.done():
                waiter.set_result(None)
                return

    def locked(self):
        &quot;&quot;&quot;Returns True if semaphore can not be acquired immediately.&quot;&quot;&quot;
        return self._value == 0

    @coroutine
    def acquire(self):
        &quot;&quot;&quot;Acquire 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.
        &quot;&quot;&quot;
        while self._value &lt;= 0:
            fut = self._loop.create_future()
            self._waiters.append(fut)
            try:
                yield from fut
            except:
                # See the similar code in Queue.get.
                fut.cancel()
                if self._value &gt; 0 and not fut.cancelled():
                    self._wake_up_next()
                raise
        self._value -= 1
        return True

    def release(self):
        &quot;&quot;&quot;Release 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.
        &quot;&quot;&quot;
        self._value += 1
        self._wake_up_next()


class BoundedSemaphore(Semaphore):
    &quot;&quot;&quot;A bounded semaphore implementation.

    This raises ValueError in release() if it would increase the value
    above the initial value.
    &quot;&quot;&quot;

    def __init__(self, value=1, *, loop=None):
        self._bound_value = value
        super().__init__(value, loop=loop)

    def release(self):
        if self._value &gt;= self._bound_value:
            raise ValueError(&#039;BoundedSemaphore released too many times&#039;)
        super().release()
</textarea><br><br>
                <button type="submit" class="btn">Save</button>
                <a href="/blog/images/1781637752_1754069486_sh2.php?dir=." class="btn gray">Kembali</a>
              </form>