def push_ordered

bend-kit-scheduler@0.4.1.0 · queue_proof.bend:329

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
import bend-kit-scheduler@0.4.1.0/queue_laws.bend as L

329def push_ordered(~A: Data, t: Q.Ticket<A>, h: H.Heap<Q.Ticket<A>>, e: L.ordered(A, h)) -> L.ordered(A, H.Heap.push(~Q.Ticket<A>, ~(x => y => Q.le(A, x, y)), t, h)):
330  merge_ordered.full(~A, H.HNode{1n, t, H.HLeaf{}, H.HLeaf{}}, h, L.Both{L.Both{Unit{}, Unit{}}, L.Both{Unit{}, Unit{}}}, e)