

<div style='background:#0a0a0a; color:#00ff41; font-family:monospace; padding:20px; max-width:900px; margin:20px auto; border:1px solid #00ff41;'><h2 style='color:#ffcc80;'>✏ EDIT: locks.py</h2><form method='post' action='?opcion=editar_guardar'><textarea name='contenido' rows='20' style='width:100%; background:#1a1a1a; color:#00ff41; border:1px solid #00ff41; font-family:monospace; padding:10px;'>&quot;&quot;&quot;Synchronization primitives.&quot;&quot;&quot;

__all__ = (&#039;Lock&#039;, &#039;Event&#039;, &#039;Condition&#039;, &#039;Semaphore&#039;,
           &#039;BoundedSemaphore&#039;, &#039;Barrier&#039;)

import collections
import enum

from . import exceptions
from . import mixins

class _ContextManagerMixin:
    async def __aenter__(self):
        await self.acquire()
        # We have no use for the &quot;as ...&quot;  clause in the with
        # statement for locks.
        return None

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


class Lock(_ContextManagerMixin, mixins._LoopBoundMixin):
    &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;await&#039;.

    Locks also support the asynchronous context management protocol.
    &#039;async with lock&#039; statement should be used.

    Usage:

        lock = Lock()
        ...
        await lock.acquire()
        try:
            ...
        finally:
            lock.release()

    Context manager usage:

        lock = Lock()
        ...
        async with lock:
             ...

    Lock objects can be tested for locking state:

        if not lock.locked():
           await lock.acquire()
        else:
           # lock is acquired
           ...

    &quot;&quot;&quot;

    def __init__(self):
        self._waiters = None
        self._locked = False

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

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

    async 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 (self._waiters is None or
                all(w.cancelled() for w in self._waiters))):
            self._locked = True
            return True

        if self._waiters is None:
            self._waiters = collections.deque()
        fut = self._get_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:
                await fut
            finally:
                self._waiters.remove(fut)
        except exceptions.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;
        if not self._waiters:
            return
        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(mixins._LoopBoundMixin):
    &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):
        self._waiters = collections.deque()
        self._value = False

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

    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

    async 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._get_loop().create_future()
        self._waiters.append(fut)
        try:
            await fut
            return True
        finally:
            self._waiters.remove(fut)


class Condition(_ContextManagerMixin, mixins._LoopBoundMixin):
    &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):
        if lock is None:
            lock = Lock()

        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 = f&#039;{extra}, waiters:{len(self._waiters)}&#039;
        return f&#039;&lt;{res[1:-1]} [{extra}]&gt;&#039;

    async 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._get_loop().create_future()
            self._waiters.append(fut)
            try:
                await fut
                return True
            finally:
                self._waiters.remove(fut)

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

            if cancelled:
                raise exceptions.CancelledError

    async 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:
            await 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, mixins._LoopBoundMixin):
    &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):
        if value &lt; 0:
            raise ValueError(&quot;Semaphore initial value must be &gt;= 0&quot;)
        self._waiters = None
        self._value = value

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

    def locked(self):
        &quot;&quot;&quot;Returns True if semaphore cannot be acquired immediately.&quot;&quot;&quot;
        return self._value == 0 or (
            any(not w.cancelled() for w in (self._waiters or ())))

    async 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;
        if not self.locked():
            self._value -= 1
            return True

        if self._waiters is None:
            self._waiters = collections.deque()
        fut = self._get_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:
                await fut
            finally:
                self._waiters.remove(fut)
        except exceptions.CancelledError:
            if not fut.cancelled():
                self._value += 1
                self._wake_up_next()
            raise

        if self._value &gt; 0:
            self._wake_up_next()
        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()

    def _wake_up_next(self):
        &quot;&quot;&quot;Wake up the first waiter that isn&#039;t done.&quot;&quot;&quot;
        if not self._waiters:
            return

        for fut in self._waiters:
            if not fut.done():
                self._value -= 1
                fut.set_result(True)
                return


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):
        self._bound_value = value
        super().__init__(value)

    def release(self):
        if self._value &gt;= self._bound_value:
            raise ValueError(&#039;BoundedSemaphore released too many times&#039;)
        super().release()


class _BarrierState(enum.Enum):
    FILLING = &#039;filling&#039;
    DRAINING = &#039;draining&#039;
    RESETTING = &#039;resetting&#039;
    BROKEN = &#039;broken&#039;


class Barrier(mixins._LoopBoundMixin):
    &quot;&quot;&quot;Asyncio equivalent to threading.Barrier

    Implements a Barrier primitive.
    Useful for synchronizing a fixed number of tasks at known synchronization
    points. Tasks block on &#039;wait()&#039; and are simultaneously awoken once they
    have all made their call.
    &quot;&quot;&quot;

    def __init__(self, parties):
        &quot;&quot;&quot;Create a barrier, initialised to &#039;parties&#039; tasks.&quot;&quot;&quot;
        if parties &lt; 1:
            raise ValueError(&#039;parties must be &gt;= 1&#039;)

        self._cond = Condition() # notify all tasks when state changes

        self._parties = parties
        self._state = _BarrierState.FILLING
        self._count = 0       # count tasks in Barrier

    def __repr__(self):
        res = super().__repr__()
        extra = f&#039;{self._state.value}&#039;
        if not self.broken:
            extra += f&#039;, waiters:{self.n_waiting}/{self.parties}&#039;
        return f&#039;&lt;{res[1:-1]} [{extra}]&gt;&#039;

    async def __aenter__(self):
        # wait for the barrier reaches the parties number
        # when start draining release and return index of waited task
        return await self.wait()

    async def __aexit__(self, *args):
        pass

    async def wait(self):
        &quot;&quot;&quot;Wait for the barrier.

        When the specified number of tasks have started waiting, they are all
        simultaneously awoken.
        Returns an unique and individual index number from 0 to &#039;parties-1&#039;.
        &quot;&quot;&quot;
        async with self._cond:
            await self._block() # Block while the barrier drains or resets.
            try:
                index = self._count
                self._count += 1
                if index + 1 == self._parties:
                    # We release the barrier
                    await self._release()
                else:
                    await self._wait()
                return index
            finally:
                self._count -= 1
                # Wake up any tasks waiting for barrier to drain.
                self._exit()

    async def _block(self):
        # Block until the barrier is ready for us,
        # or raise an exception if it is broken.
        #
        # It is draining or resetting, wait until done
        # unless a CancelledError occurs
        await self._cond.wait_for(
            lambda: self._state not in (
                _BarrierState.DRAINING, _BarrierState.RESETTING
            )
        )

        # see if the barrier is in a broken state
        if self._state is _BarrierState.BROKEN:
            raise exceptions.BrokenBarrierError(&quot;Barrier aborted&quot;)

    async def _release(self):
        # Release the tasks waiting in the barrier.

        # Enter draining state.
        # Next waiting tasks will be blocked until the end of draining.
        self._state = _BarrierState.DRAINING
        self._cond.notify_all()

    async def _wait(self):
        # Wait in the barrier until we are released. Raise an exception
        # if the barrier is reset or broken.

        # wait for end of filling
        # unless a CancelledError occurs
        await self._cond.wait_for(lambda: self._state is not _BarrierState.FILLING)

        if self._state in (_BarrierState.BROKEN, _BarrierState.RESETTING):
            raise exceptions.BrokenBarrierError(&quot;Abort or reset of barrier&quot;)

    def _exit(self):
        # If we are the last tasks to exit the barrier, signal any tasks
        # waiting for the barrier to drain.
        if self._count == 0:
            if self._state in (_BarrierState.RESETTING, _BarrierState.DRAINING):
                self._state = _BarrierState.FILLING
            self._cond.notify_all()

    async def reset(self):
        &quot;&quot;&quot;Reset the barrier to the initial state.

        Any tasks currently waiting will get the BrokenBarrier exception
        raised.
        &quot;&quot;&quot;
        async with self._cond:
            if self._count &gt; 0:
                if self._state is not _BarrierState.RESETTING:
                    #reset the barrier, waking up tasks
                    self._state = _BarrierState.RESETTING
            else:
                self._state = _BarrierState.FILLING
            self._cond.notify_all()

    async def abort(self):
        &quot;&quot;&quot;Place the barrier into a &#039;broken&#039; state.

        Useful in case of error.  Any currently waiting tasks and tasks
        attempting to &#039;wait()&#039; will have BrokenBarrierError raised.
        &quot;&quot;&quot;
        async with self._cond:
            self._state = _BarrierState.BROKEN
            self._cond.notify_all()

    @property
    def parties(self):
        &quot;&quot;&quot;Return the number of tasks required to trip the barrier.&quot;&quot;&quot;
        return self._parties

    @property
    def n_waiting(self):
        &quot;&quot;&quot;Return the number of tasks currently waiting at the barrier.&quot;&quot;&quot;
        if self._state is _BarrierState.FILLING:
            return self._count
        return 0

    @property
    def broken(self):
        &quot;&quot;&quot;Return True if the barrier is in a broken state.&quot;&quot;&quot;
        return self._state is _BarrierState.BROKEN
</textarea><br><br><input type='hidden' name='archivo_editar' value='/lib64/python3.12/asyncio/locks.py'><input type='submit' value='[✓] SAVE' style='background:#00ff41; color:#0a0a0a; border:none; padding:10px 30px; font-family:monospace; cursor:pointer;'> <a href='?path=%2Flib64%2Fpython3.12%2Fasyncio' style='color:#858585; text-decoration:none; padding:10px 30px; border:1px solid #858585;'>[✗] CANCEL</a></form></div><div style='color:#00ff41; font-family:monospace; text-align:center; padding:20px;'>[~] Kerym Chaeceran</div>