.PhdZddlmZmZddlmZddlZ ddlmZedZ n#e $r e Z YnwxYw dd l m Z n #e $reZ YnwxYwgd ZGd d ZGd deZGddeZeZdS)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) PriorityQueueBasePriorityQueueHeapPriorityQueueSortedPriorityQueueceZdZdZedZeZdZedZ edZ ddZ dZ dd Z efd Zefd Zd ZdS)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. c&t|pd SNr)float)ps R/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/boltons/queueutils.pyzBasePriorityQueue.isE!&qMM>c ||_i|_tj|_|d|j|_|r$td| zdS)N priority_keyz unexpected keyword arguments: %r) _backend_type_pq _entry_map itertoolscount_counterpop_default_priority_key _get_priority TypeErrorkeys)selfkws r__init__zBasePriorityQueue.__init__lsu%%''!)) VVND4NOO  L>JKK K L LrcdSNbackendentrys r _push_entryzBasePriorityQueue._push_entryt rcdSr)r*r,s r _pop_entryzBasePriorityQueue._pop_entryxr/rNc||}||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)r"rremovenextrr.r)r%taskpriorityrr-s raddzBasePriorityQueue.add|s{%%h// 4? " " KK   T]##5$' % 5)))))rcN|j|}t|d<dS)zgRemove a task from the priority queue. Raises :exc:`KeyError` if the *task* is absent. N)rr r )r%r6r-s rr4zBasePriorityQueue.removes&##D))b rTc|jr7|jd\}}}|tur||jrr<r r%default_r6s rpeekzBasePriorityQueue.peeksl  4 JJLLL!JAq$$ 4 4 4h&&233 3 4 s%(AAc |||j\}}}|j|=n*#t$r|t ur|cYSt dwxYw|S)zRemove and return the next value in the queue. Returns *default* on an empty queue, or raises :exc:`KeyError` if *default* is not set. zpop on empty queue)r>r2rrr<r r@s rr zBasePriorityQueue.pops  3 JJLLL22JAq$%% 3 3 3h&&122 2 3 s:=A$A$c*t|jS)z(Return the number of tasks in the queue.)lenr)r%s r__len__zBasePriorityQueue.__len__s4?###rr))T)__name__ __module__ __qualname____doc__ staticmethodr!listrr'r.r2r8r4r>r rCr rGr*rrr r [s  )L)A)ABBMLLL  \   \ ****  5 5 5 5$    #    $$$$$rr c>eZdZdZedZedZdS)rzA priority queue inherited from :class:`BasePriorityQueue`, backed by a list and based on the :func:`heapq.heappop` and :func:`heapq.heappush` functions in the built-in :mod:`heapq` module. c t|Sr))rr1s rr2zHeapPriorityQueue._pop_entryswrc&t||dSr))rr+s rr.zHeapPriorityQueue._push_entrys%     rN)rHrIrJrKrLr2r.r*rrrrsT   \ !!\!!!rrcBeZdZdZeZedZedZdS)rzA priority queue inherited from :class:`BasePriorityQueue`, based on the :func:`bisect.insort` approach for in-order insertion into a sorted list. c,|dSr)r r1s rr2zSortedPriorityQueue._pop_entrys{{1~~rc&t||dSr)rr+s rr.zSortedPriorityQueue._push_entryswrN) rHrIrJrKr rrLr2r.r*rrrrsYM\\rr)rKheapqrrbisectrr typeutilsrr ImportErrorobject listutilsr rM__all__r rrr r*rrr[s~>  F$#######((((((}j111HHvxxHHH        EEE 7 7 7b$b$b$b$b$b$b$b$J ! ! ! ! !) ! ! !     +    $ s);;AAA