def enqueue

bend-kit-scheduler@0.4.1.0 · queue.bend:41

import Base
import bend-kit-collections@0.1.4.1/heap.bend as H

41def enqueue(~A: Data, d: Nat, x: A, s: State<A>) -> State<A> & Nat:
42  match s:
43    case State{+i, h, r}:
44      (State{1n+i, H.Heap.push(~Ticket<A>, ~(a => b => le(A, a, b)), Ticket{i, d, x}, h), r}, i)