law absent_find

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

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

160law absent_find:
161  for -A: Data
162  for +xs: List<&2, Q.Ticket<A>>
163  for +i: Nat
164  for e: absent.list(A, xs, i)
165  {Q.find.list(A, xs, i) == None{} : Maybe<&2, Q.Ticket<A>>}