def absent.list

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

import Base
import bend-kit-scheduler@0.4.1.0/queue.bend as Q

61def absent.list(-A: Data, xs: List<&2, Q.Ticket<A>>, +i: Nat) -> Data:
62  match xs:
63    case Nil{}:
64      Unit
65    case Con{t, rest}:
66      Both<{Nat.is_eq(Q.id(A, t), i) == False{} : Bool}, absent.list(A, rest, i)>