cdZddlmZmZddlmZddlZ ddlmZedZ dd l m Z gd ZGd d e ZGd deZGddeZeZy#e $r e Z Y=wxYw#e $reZ YCwxYw)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|eZdZdZedZeZdZedZ edZ d dZ dZ dd Z efd Zefd Zd Zy)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|xsd SNr)float)ps 2lib/python3.12/site-packages/boltons/queueutils.pyzBasePriorityQueue.ksE!&qM>c |j|_i|_tj|_|j d|j|_|rtd|jzy)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__ns_%%'!) VVND4N4NO >JK K rcyNbackendentrys r _push_entryzBasePriorityQueue._push_entryv rcyr)r*r,s r _pop_entryzBasePriorityQueue._pop_entryzr/rNc|j|}||jvr|j|t|j}|||g}||j|<|j |j |y)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~sh%%h/ 4?? " KK T]]#5$' % 5)rcL|jj|}t|d<y)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 rc|jr8|jd\}}}|tur|j|jCy|r tdy)zBRemove entries marked as removed by previous :meth:`remove` calls.rNzempty priority queue)rr r2 IndexError)r% raise_excr7rr6s r_cullzBasePriorityQueue._cullsOhh$(HHQK !HeTx)  34 4 rc |j|jd\}}}|S#t$r|tur|cYStdwxYw)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)r>rr<r r%default_r6s rpeekzBasePriorityQueue.peeksT  4 JJL!JAq$   4h&23 3 4s#'A Ac |j|j|j\}}}|j|=|S#t$r|t ur|cYSt dwxYw)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.popse  3 JJL2JAq$%   3h&12 2 3sr rCr rGr*rrr r ]sp ))ABML    *  5$ # $rr c0eZdZdZedZedZy)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. ct|Sr))rr1s rr2zHeapPriorityQueue._pop_entrys wrct||yr))rr+s rr.zHeapPriorityQueue._push_entrys % rN)rHrIrJrKrLr2r.r*rrrrs/   !!rrc4eZdZdZeZedZedZy)rzA priority queue inherited from :class:`BasePriorityQueue`, based on the :func:`bisect.insort` approach for in-order insertion into a sorted list. c$|jdSr)r r1s rr2zSortedPriorityQueue._pop_entrys{{1~rct||yr)rr+s rr.zSortedPriorityQueue._push_entrys wrN) rHrIrJrKr rrLr2r.r*rrrrs4Mrr)rKheapqrrbisectrr typeutilsrr ImportErrorobject listutilsr rM__all__r rrr r*rrr[sB F$(j1H  7b$b$J !) ! +  $ mxH  Es"AA& A#"A#&A0/A0