def all.heap

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

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

68def all.heap(-A: Data, -P: Q.Ticket<A> -> Data, h: H.Heap<Q.Ticket<A>>) -> Data:
69  match h:
70    case H.HLeaf{}:
71      Unit
72    case H.HNode{n, t, l, r}:
73      Both<P(t), Both<all.heap(A, P, l), all.heap(A, P, r)>>