+ &hRt^RIHtHt^RIHt^RIt^RIHt]!RR7t ^RI H t .ROt!R R4t!R R ]4t!R R ]4t]tR# ] d ] !4t L?i;i ] d]t LGi;i)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)BListBasePriorityQueueHeapPriorityQueueSortedPriorityQueueca]tRt^[toRt]!R4t]tRt ]R4t ]R4t RRlt Rt RR lt]3R lt]3R ltR tR tVtR#)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;'g^4)#)float)ps&2lib/python3.14/site-packages/boltons/queueutils.pyBasePriorityQueue.isE!&&qM>c VP4Vn/Vn\P!4VnVP RVP4VnV'd!\RVP4,4hR#) priority_keyz unexpected keyword arguments: %rN) _backend_type_pq _entry_map itertoolscount_counterpop_default_priority_key _get_priority TypeErrorkeys)selfkws&,r__init__BasePriorityQueue.__init__ls_%%'!) VVND4N4NO >JK K rcR#Nbackendentrys&&r _push_entryBasePriorityQueue._push_entryt rcR#r)r*r,s&r _pop_entryBasePriorityQueue._pop_entryxr0rNc VPV4pWP9dVPV4\VP4pW#V.pW@PV&VP VP V4R#)a  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&&& raddBasePriorityQueue.add|sb%%h/ ?? " KK T]]#$' % 5)rc NVPPV4p\VR&R#)zWRemove a task from the priority queue. Raises :exc:`KeyError` if the *task* is absent. N)rrr)r$r8r-s&& rr6BasePriorityQueue.removes!##D)b rc VP'd@VP^,wr#pV\JdVPVP4KOR#V'd \R4hR#)zBRemove entries marked as removed by previous :meth:`remove` calls.Nzempty priority queue)rrr3 IndexError)r$ raise_excr9rr8s&& r_cullBasePriorityQueue._cullsOhhh$(HHQK !HTx)  34 4 rc VP4VP^,wr#V# \dT\JdTu#\R4hi;i)zRead the next value in the queue without removing it. Returns *default* on an empty queue, or raises :exc:`KeyError` if *default* is not set. zpeek on empty queue)rBrr@rr$default_r8s&& rpeekBasePriorityQueue.peeksR  4 JJL!JAq   4h&23 3 4s&*A Ac VP4VPVP4wr#VPVV# \dT\ JdTu#\ R4hi;i)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)rBr3rrr@rrEs&& rrBasePriorityQueue.popsc  3 JJL2JAq%   3h&12 2 3s;?A$ A$c ,\VP4#)z(Return the number of tasks in the queue.)lenr)r$s&r__len__BasePriorityQueue.__len__s4??##r)rrr!rr))T)__name__ __module__ __qualname____firstlineno____doc__ staticmethodr listrr&r.r3r:r6rBrrHrrN__static_attributes____classdictcell__ __classdict__s@rr r [sx ))ABML    *  5$ # $$rcDa]tRt^toRt]R4t]R4tRtVt R#)r zA 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\V4#r))rr2s&rr3HeapPriorityQueue._pop_entrys wrc\W4R#r))rr+s&&rr.HeapPriorityQueue._push_entrys  rr*N) rPrQrRrSrTrUr3r.rWrXrYs@rr r s2   !!rcHa]tRt^toRt]t]R4t]R4t Rt Vt R#)r zA priority queue inherited from :class:`BasePriorityQueue`, based on the :func:`bisect.insort` approach for in-order insertion into a sorted list. c$VP^4#r)rr2s&rr3SortedPriorityQueue._pop_entrys{{1~rc\W4R#r)rr+s&&rr.SortedPriorityQueue._push_entrys wrr*N) rPrQrRrSrTr rrUr3r.rWrXrYs@rr r s7Mr) PriorityQueuer r r )rTheapqrrbisectrr typeutilsrr ImportErrorobject listutilsr rV__all__r r r rer*rrrms> F$(j1H  7b$b$J !) ! +  $ mxH  Es"AA(A%$A%( A43A4