zc3 8dZddlZGddejZdS)u Utility collections or "bricks". :module: watchdog.utils.bricks :author: yesudeep@google.com (Yesudeep Mangalapilly) :author: lalinsky@gmail.com (Lukáš Lalinský) :author: python@rcn.com (Raymond Hettinger) :author: contact@tiger-222.fr (Mickaël Schoentgen) Classes ======= .. autoclass:: OrderedSetQueue :members: :show-inheritance: :inherited-members: .. autoclass:: OrderedSet Nc6eZdZdZfdZfdZfdZxZS)SkipRepeatsQueueaThread-safe implementation of an special queue where a put of the last-item put'd will be dropped. The implementation leverages locking already implemented in the base class redefining only the primitives. Queued items must be immutable and hashable so that they can be used as dictionary keys. You must implement **only read-only properties** and the :meth:`Item.__hash__()`, :meth:`Item.__eq__()`, and :meth:`Item.__ne__()` methods for items to be hashable. An example implementation follows:: class Item: def __init__(self, a, b): self._a = a self._b = b @property def a(self): return self._a @property def b(self): return self._b def _key(self): return (self._a, self._b) def __eq__(self, item): return self._key() == item._key() def __ne__(self, item): return self._key() != item._key() def __hash__(self): return hash(self._key()) based on the OrderedSetQueue below cXt|d|_dSN)super_init _last_item)selfmaxsize __class__s 5lib/python3.11/site-packages/watchdog/utils/bricks.pyrzSkipRepeatsQueue._initUs$  gc|j ||jkr*t|||_dS|xjdzc_dS)N)r r_putunfinished_tasksr itemr s r rzSkipRepeatsQueue._putYsX ? 'ddo&= ' GGLL   "DOOO  ! !Q & ! ! ! !rcht}||jurd|_|Sr)r_getr rs r rzSkipRepeatsQueue._getbs/ww||~~ 4? " #"DO r)__name__ __module__ __qualname____doc__rrr __classcell__)r s@r rr*su''R'''''rr)rqueueQueuerrr rsP&( <<<<<u{<<<<<r