Queue.requeue.found: def of bend-kit-scheduler@0.4.1.0
Import: import bend-kit-scheduler@0.4.1.0/queue.bend as Queue
Lines 145-152 of bend-kit-scheduler@0.4.1.0/queue.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-scheduler@0.4.1.0/queue.bend&start_line=145&end_line=152
import Base
import bend-kit-collections@0.1.4.1/heap.bend as H
def requeue.found(~A: Data, found: Maybe<&2, Ticket>, d: Nat, s: State) -> State & Bool:
match found:
case None{}:
(s, False{})
case Some{Ticket{i, old, x}}:
match s:
case State{n, h, r}:
(State{n, H.Heap.push(~Ticket, ~(a => b => le(A, a, b)), Ticket{i, d, x}, h), r}, True{})
Uses (9):
https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
https://jend.leeeet.dev/definition.txt?path=bend-kit-collections@0.1.4.1/heap.bend&name=Heap.push
https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/queue.bend&name=State
https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/queue.bend&name=Ticket
https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/queue.bend&name=le