ViSrSSKJrJr SSKJr SSKrSSKJr \"SS9r SSK J r /S Qr"S S \ 5r"S S \5r"SS\5r\rg!\ a \ "5r N>f=f!\ a \r NEf=f)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\rSrSrSr\"S5r\rSr \S5r \S5r SSjr S r SS jr\4S jr\4S jrS rSrg)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,[U=(d S5*$Nr)float)ps e/home/james-whalen/.local/share/pipx/venvs/semgrep/lib/python3.13/site-packages/boltons/queueutils.pyBasePriorityQueue.ksE!&qM>c UR5Ul0Ul[R"5UlUR SUR5UlU(a[SUR5-5eg)N priority_keyz unexpected keyword arguments: %r) _backend_type_pq _entry_map itertoolscount_counterpop_default_priority_key _get_priority TypeErrorkeys)selfkws r__init__BasePriorityQueue.__init__ns_%%'!) VVND4N4NO >JK K rcgNbackendentrys r _push_entryBasePriorityQueue._push_entryv rcgr+r,r.s r _pop_entryBasePriorityQueue._pop_entryzr2rNcURU5nXR;aURU5 [UR5nX#U/nX@RU'UR UR U5 g)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#rremovenextr r0r)r&taskpriorityrr/s raddBasePriorityQueue.add~sb%%h/ ?? " KK T]]#$' % 5)rcLURRU5n[US'g)zWRemove a task from the priority queue. Raises :exc:`KeyError` if the *task* is absent. N)rr!r)r&r:r/s rr8BasePriorityQueue.removes!##D)b rcUR(a9URSup#nU[LaURUR5 MIgU(a [S5eg)zBRemove entries marked as removed by previous :meth:`remove` calls.rNzempty priority queue)rrr5 IndexError)r& raise_excr;rr:s r_cullBasePriorityQueue._cullsMhh$(HHQK !HTx)  34 4 rcUR5 URSu p#U$![a U[LaUs$[S5ef=f)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. rzpeek on empty queue)rDrrBrr&default_r:s rpeekBasePriorityQueue.peeksR  4 JJL!JAq   4h&23 3 4s"&A  A cUR5 URUR5u p#URU U$![a U[ LaUs$[ S5ef=f)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)rDr5rrrBrrGs rr!BasePriorityQueue.popsc  3 JJL2JAq%   3h&12 2 3s;?A" A"c,[UR5$)z(Return the number of tasks in the queue.)lenr)r&s r__len__BasePriorityQueue.__len__s4??##r)r rr#rr+)T)__name__ __module__ __qualname____firstlineno____doc__ staticmethodr"listrr(r0r5r<r8rDrrJr!rP__static_attributes__r,rrr r ]sp ))ABML    *  5$ # $rr c8\rSrSrSr\S5r\S5rSrg)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[U5$r+)rr4s rr5HeapPriorityQueue._pop_entrys wrc[X5 gr+)rr-s rr0HeapPriorityQueue._push_entrys  rr,N) rRrSrTrUrVrWr5r0rYr,rrr r s/   !!rr c<\rSrSrSr\r\S5r\S5r Sr g)rzA priority queue inherited from :class:`BasePriorityQueue`, based on the :func:`bisect.insort` approach for in-order insertion into a sorted list. c$URS5$r)r!r4s rr5SortedPriorityQueue._pop_entrys{{1~rc[X5 gr+rr-s rr0SortedPriorityQueue._push_entrys wrr,N) rRrSrTrUrVr rrWr5r0rYr,rrrrs4Mrr)rVheapqrrbisectrr typeutilsrr ImportErrorobject listutilsr rX__all__r r rr r,rrrmsB F$'j1H  7b$b$J !) ! +  $ mxH  Es" AA$ A! A!$A/.A/