a  d@sdZddlmZmZddlmZddlZzddlmZeddZ Wne yZe Z Yn0zdd l m Z Wne yeZ Yn0gd ZGd d d e ZGd ddeZGdddeZeZdS)aPython comes with a many great data structures, from :class:`dict` to :class:`collections.deque`, and no shortage of serviceable algorithm implementations, from :func:`sorted` to :mod:`bisect`. But priority queues are curiously relegated to an example documented in :mod:`heapq`. Even there, the approach presented is not full-featured and object-oriented. There is a built-in priority queue, :class:`Queue.PriorityQueue`, but in addition to its austere API, it carries the double-edged sword of threadsafety, making it fine for multi-threaded, multi-consumer applications, but high-overhead for cooperative/single-threaded use cases. The ``queueutils`` module currently provides two Queue implementations: :class:`HeapPriorityQueue`, based on a heap, and :class:`SortedPriorityQueue`, based on a sorted list. Both use a unified API based on :class:`BasePriorityQueue` to facilitate testing the slightly different performance characteristics on various application use cases. >>> pq = PriorityQueue() >>> pq.add('low priority task', 0) >>> pq.add('high priority task', 2) >>> pq.add('medium priority task 1', 1) >>> pq.add('medium priority task 2', 1) >>> len(pq) 4 >>> pq.pop() 'high priority task' >>> pq.peek() 'medium priority task 1' >>> len(pq) 3 )heappushheappopinsortN) make_sentinel_REMOVED)var_name)BList) PriorityQueueBasePriorityQueueHeapPriorityQueueSortedPriorityQueuec@s|eZdZdZeddZeZddZeddZ edd Z dd d Z d dZ dddZ efddZefddZddZd S)r aThe abstract base class for the other PriorityQueues in this module. Override the ``_backend_type`` class attribute, as well as the :meth:`_push_entry` and :meth:`_pop_entry` staticmethods for custom subclass behavior. (Don't forget to use :func:`staticmethod`). Args: priority_key (callable): A function that takes *priority* as passed in by :meth:`add` and returns a real number representing the effective priority. cCst|pd SNr)float)pr[/var/www/html/stable-diffusion-webui/venv/lib/python3.9/site-packages/boltons/queueutils.pykzBasePriorityQueue.cKsB||_i|_t|_|d|j|_|r>t d| dS)NZ priority_keyz unexpected keyword arguments: %r) _backend_type_pq _entry_map itertoolscount_counterpop_default_priority_key _get_priority TypeErrorkeys)selfkwrrr__init__ns   zBasePriorityQueue.__init__cCsdSNrbackendentryrrr _push_entryvszBasePriorityQueue._push_entrycCsdSr$rr&rrr _pop_entryzszBasePriorityQueue._pop_entryNcCsN||}||jvr||t|j}|||g}||j|<||j|dS)aP Add a task to the queue, or change the *task*'s priority if *task* is already in the queue. *task* can be any hashable object, and *priority* defaults to ``0``. Higher values representing higher priority, but this behavior can be controlled by setting *priority_key* in the constructor. N)rrremovenextrr(r)r!taskpriorityrr'rrradd~s      zBasePriorityQueue.addcCs|j|}t|d<dS)zgRemove a task from the priority queue. Raises :exc:`KeyError` if the *task* is absent. N)rrr)r!r-r'rrrr+s zBasePriorityQueue.removeTcCs@|jr0|jd\}}}|tur,||jqdS|r__all__r r rr rrrr!s"#      e