def absent.heap

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

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

81def absent.heap(-A: Data, h: H.Heap<Q.Ticket<A>>, +i: Nat) -> Data:
82  all.heap(A, absent.ticket(A, i), h)