law complete_equivalent

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

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

48law complete_equivalent:
49  for -A: Data
50  for +i: Nat
51  for +s: Q.State<A>
52  {Q.complete(A, i, s) == complete.reference(A, i, s) : Q.State<A> & Maybe<&2, Q.Ticket<A>>}