law take_equivalent

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

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

42law take_equivalent:
43  for -A: Data
44  for +xs: List<&2, Q.Ticket<A>>
45  for +i: Nat
46  {Q.take.list(A, xs, i) == Q.Taken{Q.remove.list(A, xs, i), Q.find.list(A, xs, i)} : Q.Taken<A>}