def minimum

bend-kit-scheduler@0.4.1.0 · queue_laws.bend:108

import Base
import bend-kit-collections@0.1.4.1/heap.bend as H
import bend-kit-scheduler@0.4.1.0/queue.bend as Q

108def minimum(-A: Data, h: H.Heap<Q.Ticket<A>>, selected: Maybe<&2, Q.Ticket<A>>) -> Data:
109  match selected:
110    case None{}:
111      Unit
112    case Some{t}:
113      below(A, h, t)